import math

def mCn(m,n):
    if (n > m):
        return 0
    greater = max(n, m-n)
    lesser = min(n, m-n)
    numerator = 1
    denominator = 1
    for i in xrange(m, greater, -1):
        numerator *= i
    for i in xrange(1, lesser+1):
        denominator *= i
    return numerator / denominator

P = 100003
P_list = [P**i for i in xrange(4)]
P_list.reverse()
T = int(raw_input().split()[0])
for t in xrange(T):
    N,K = tuple([int(i) for i in raw_input().split()])
    extras = N-K-K+1
    if extras < 0:
        print "0"
        continue
    m = K+extras
    n = min(extras, K)
    m_list = []
    n_list = []
    for p in P_list:
        m_list.append(m / p)
        n_list.append(n / p)
        m = m % p
        n = n % p
    #print m_list, n_list
    sol = 1
    for i in xrange(len(P_list)):
        sol = (sol * mCn(m_list[i], n_list[i])) % P
    print sol