# Enter your code here. Read input from STDIN. Print output to STDOUT

p = 100003

memo = {}

def mul_inv(a, b):
    if b == 1: return 1
    b_init = b
    a_init = a
    r,s = 0,1
    while a > 1:
        q = a/b
        a, b = b, a%b
        r, s = s - q*r, r
    if s < 0: s += b_init
    return s

def fact(n, p=None):
    m = 1
    while n:
        m = (m * n)
        if p: m = m % p
        n -= 1
    return m

def choose(n, k):
    if k == 0: return 1
    num = 1
    den = 1
    for m in xrange(n, n-k, -1): num = (num*m)%p
    for m in xrange(1, k+1): den = (den*m)%p
    return (num * mul_inv(den,p)) % p

for _ in xrange(int(raw_input())):
    N,K = map(int, raw_input().split())
    a = N - K - (K-1)
    b = K 
    if a < 0 or b < 0: print 0
    else:
        print choose(a+b, min(a,b))