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


import sys

prime = 100003

def ext_euclid(a, b):
    if b == 0:
        return 1, 0
    x, y = ext_euclid(b, a % b)
    return (y, x - a / b * y)


def comp(n, k):
    if n < k:
        return 0
    if n - k < k:
        k = n - k

    result = 1
    for t in range(n-k+1, n+1):
        result = result * t % prime

    divide = 1
    for t in range(1, k+1):
        divide = divide * t % prime
    u = (ext_euclid(prime, divide)[1])
    while (u < 0):
        u += prime
    result = result * u % prime
    return result


def lucas(n, m, p):
    if n < m:
        return 0
    if m == 0:
        return 1
    return comp(n%p, m%p) * lucas(n/p, m/p, p) % p


q = int(sys.stdin.readline())
for i in range(q):
    w = sys.stdin.readline().split()
    a = int(w[0])
    b = int(w[1])
    print lucas(a-b+1, b, prime)