# Enter your code here. Read input from STDIN. Print output to STDOUT
M=100003
def modBinomial(n,k):
    if(n==0):
        return 1
    if n<k:
        return 1
    M=100003
    pascal = [1,1]

    for i in range(2,n+1):
        sublist=[1]
        for j in range(1,len(pascal)):
            sublist.append((pascal[j]+pascal[j-1]))
            
        sublist.append(1)
        pascal=sublist

    return pascal[k]

def fast(p,k):
    res = 1

    
    for i in range(1,k+1):
   
        i2 = findMMI_fermat(i,M)

        temp = ((p%M-k%M + M)%M +i%M)%M
        temp = (temp*i2) % M
        res = (res % M * temp) % M
        
    return res

def fast_pow(base, n, M):
    
    if n==0:
        return 1
    if n==1:
        return base
        
    halfn = fast_pow(base, n/2, M)
    
    if n%2==0:
        return ((halfn*halfn)%M)
        
    else:
        return (( ( ( halfn * halfn ) % M ) * base ) % M)
        
def findMMI_fermat(n, M):
    return fast_pow(n, M-2, M)
def method1(x):
    M=100003
    d1=x/M**2
    d2 = (x - d1 * M**2)/ M**1
    d3 = x - d1 * M**2 - d2 * M**1
    return [d1,d2,d3]
    
    
def peaceLovers(lista):
    M=100003
    n = lista[0]
    k = lista[1]
    p = n-k+1
    if p < k:
        print 0
        return 
    else:
        #result = modBinomial(p,k)
        list1 = method1(p)
        list2 = method1(k)
        
        result = ((fast(list1[0],list2[0])%M) * (fast(list1[1],list2[1])%M) * (fast(list1[2],list2[2])%M)) % M
        print result
        return

numofCases = input()
for i in range(numofCases):
    list1 = map(int, raw_input().strip().split(" "))
    peaceLovers(list1)