# Enter your code here. Read input from STDIN. Print output to STDOUT
def inverse_mod(n, p):
    inv = 1
    cur = n
    k = p - 2 
    while k:
        if k % 2:
            inv = (inv * cur) % p
        k /= 2
        cur = (cur * cur) % p
    return inv

def choose_mod(n, k, p):
    if n < k:
        return 0
    elif k == 0 or k == n:
        return 1
    elif k > n / 2:
        k = n - k
    num, den = n, 1
    for i in xrange(2, k+1):
        den = (den * i) % p
        num = (num * (n-i+1)) % p
    den = inverse_mod(den, p)
    return (num * den) % p

def nways(n, k, p):
    if k < p:
        return choose_mod(n, k, p)
    qn = n / p
    rn = n % p
    qk = k / p
    rk = k % p
    choose = choose_mod(rn, rk, p)
    choose *= nways(qn, qk, p)
    return choose % p

def main():
    T = input()
    for i in xrange(T):
        N, K = map(int, raw_input().strip().split())
        print nways(N-K+1, K, 100003)

if __name__ == '__main__':
    main()