import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner sc = new Scanner(System.in);        
        int cases = sc.nextInt();
        final long mod = 100003;
        final long modsq = 100003 * 100003;
        int test = 0;
        long n, k;
        long num, den, diff, temp;
        long num0, den0;
        
        long inv;
        
        while(test < cases) {
            n = sc.nextLong();
            k = sc.nextLong();
            
            if(k > n - k + 1)
                System.out.println(0);
            else {        
                n = n - k + 1;
                diff = n - k;
                
                if(diff > k) {
                    temp = k;
                    k = diff;
                    diff = temp;
                }
                
                num = 1;
                num0 = 0;
                
                while(n > k) {
                    if(n % modsq == 0) {
                        num *= (n / modsq) % mod;
                        num0 += 2;
                    }
                    else if(n % mod == 0) {
                        num *= (n / mod) % mod;
                        num0++;
                    }
                    else num *= n % mod;
                    num %= mod;
                    n--;
                }
                
                den = 1;
                den0 = 0;
                
                while(diff > 1) {
                    if(diff % modsq == 0) {
                        den *= (diff / modsq) % mod;
                        den0 += 2;
                    }
                    else if(diff % mod == 0) {
                        den *= (diff / mod) % mod;
                        den0++;
                    }
                    else den *= diff % mod;
                    den %= mod;
                    diff--;
                }
                
                inv = 1;
                
                if(num0 > den0)
                    System.out.println(0);
                else {
                    while((den * inv) % mod != 1) {
                        inv++;
                    }
                    
                    System.out.println((num * inv) % mod);
                }
            }
            
            test++;
        }
    }
}