MOD = 100003

def fast_pow(base, ex):
    if ex == 0:
        return 1
    else:
        temp = fast_pow(base, ex / 2)
        if ex % 2 == 1:
            return (temp * temp * base) % MOD
        else:
            return (temp * temp) % MOD

def get_mod_inverse(x):
    return fast_pow(x, MOD - 2)

def slow_binom(n, k):
    k = min(k, n - k)
    res = 1
    for i in range(1, k + 1):
        res = (res * (n - i + 1)) % MOD
        res = (res * get_mod_inverse(i)) % MOD
    return res

def binom(n, k):
    if k > n:
        return 0
    res = 1
    while n > 0 and k > 0:
        if n % MOD < k % MOD:
            return 0
        res = (res * slow_binom(n % MOD, k % MOD)) % MOD
        n /= MOD
        k /= MOD
    return res

# if n - 2k + 1 < 0 we return 0
def solve(n, k):
    if n - 2 * k + 1 < 0:
        return 0
    else:
        return binom(n - 2 * k + 1 + k + 1 - 1, k + 1 - 1)

T = int(raw_input())
for t in range(1, T + 1):
    N, K = map(int, raw_input().strip().split(' '))
    print solve(N, K)