mod = 100003
def ncr(n,r):
    if n-r < r:
        r = n-r
    s = 1
    for i in xrange(r):
        s = ((s*(n-i))/(i+1))
    return s%mod
def solve(n,k):
    ex = n-k
    g = k-1
    lft = ex - g
    g += 2
    if lft <= 0:
        return 0
    else:
        s = ncr(g+lft-1,lft)
    return s
for _ in xrange(input()):
    n,k = map(int,raw_input().split())
    print solve(n,k)