# Enter your code here. Read input from STDIN. Print output to STDOUT
import operator as op
def ncrReduce(n, r):
    r = min(r, n-r)
    if r == 0: return 1
    if (n < 100003 and r < 100003):
        return ncr(n,r)
    a1 = n / 100003
    a2 = r / 100003
    b1 = n % 100003
    b2 = r % 100003
    return (ncrReduce(a1, a2) * ncrReduce(b1, b2)) % 100003
    
def ncr(n, k):
    """
    A fast way to calculate binomial coefficients by Andrew Dalke (contrib).
    """
    if 0 <= k <= n:
        ntok = 1
        ktok = 1
        for t in xrange(1, min(k, n - k) + 1):
            ntok *= n % 100003 
            ktok *= t % 100003 
            n -= 1
        return ntok // ktok
    else:
        return 0

# def multimod(a, b):
#     return op.mod(op.mul(a, b), 100003)

def findInv(a):
    res = 1
    cur = a
    k = 100001
    
    while (k > 0):
        if k % 2:
            res = (res * cur) % 100003
        k /= 2
        cur = (cur * cur) % 100003
    return res

if __name__ == "__main__":
    T = input()
    ans = []
    for i in range(T):
        s = raw_input()
        N = int(s.split(' ')[0])
        K = int(s.split(' ')[1])
        if (N-K+1 < K):
            ans.append(0)
        else:
            ans.append(ncrReduce(N-K+1, K) % 100003)

    
    for i in range(T):
        print ans[i]