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


def fnc(n):
    r = 1
    for i in xrange(1, n+1):
        r = (r*i) % p
    return r

def power(n, p):
    t = n
    result = 0
    while (t > 0):
        t = t/p
        result += t
    return result

def is_divisible(n, k, p):
    return power(n, p) > (power(k, p) + power(n-k, p))

def find_module(n, p):  # n! % p
    if n < p:
        return fnc(n)
    t = n/p
    r = n % p
    if t % 2 == 0:
        mod = 1
    else:
        mod = -1
    return (find_module(t, p) * mod * fnc(r)) % p

def find_power_mod(x, y, p):
    if y == 0:
        return 1
    xx = x*x % p
    if y % 2 == 0:
        return find_power_mod(xx, y/2, p)
    else:
        return find_power_mod(xx, y/2, p)*x % p

def binomialCoeff(n, k):
    if is_divisible(n, k, p) or n < k:
        return 0
    a = find_module(n, p)
    b = find_module(k, p)
    c = find_module(n-k, p)
    result = find_power_mod(b * c, p-2, p)*a % p
    return result

def compute(n, k):
    return binomialCoeff(n-k+1, k) % p

 


T = input()
A = []
for _ in range(T):
    N, K = tuple([int(s) for s in raw_input().split()])
    print compute(N, K)