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

def modPow(a, x, p):
    res = 1
    while(x > 0):
        if( x % 2 != 0):
            res = (res * a) % p
        a = (a * a) % p
        x /= 2
    return res

def modInverse(a, p):
    return modPow(a, p-2, p);

def modBinomial(n, k, p):
    numerator = 1
    for i in range(k):
        numerator = (numerator * (n-i) ) % p
    
    denominator = 1
    for i in range(1, k + 1):
        denominator = (denominator * i) % p
    
    return ( numerator* modInverse(denominator,p) ) % p;

T = int(raw_input())
for tc in range(T):
    N, K = map(int, raw_input().split())
    N = N - K + 1
    if N < K:
        print 0
        continue
    print modBinomial(N, K, 100003)