from itertools import * pro = lambda l,p: reduce(lambda x,y: (x*y)%p, l, 1) def base_convert(n,p): rep = [] while n>0: rep.append(n%p) n /= p return rep def pad(bigger,smaller): while len(bigger) > len(smaller): smaller.append(0) return smaller # lucas theorem def binom_mod(n,k,p): inv = lambda x: pow(x,p-2,p) facp = lambda n: pro(xrange(1,n+1),p) def binom_mod_helper(a,b): return 0 if a<b else (facp(a)*inv(facp(b))*inv(facp(a-b)))%p n_expansion = base_convert(n,p) k_expansion = pad(n_expansion,base_convert(k,p)) return pro(map(binom_mod_helper,n_expansion,k_expansion),p) def solve(n,k): if n >= 2*k-1: return binom_mod(n-k+1,k,100003) else: return 0 T = int(raw_input()) for caseno in xrange(T): N,K = map(int, raw_input().split()) print solve(N,K)