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

public class Solution {
    
    // calculate n choose k = (n)(n-1)...(n-k+1)/(k(k-1)...1)
    static BigInteger choose(int n, int k) {
        BigInteger x = BigInteger.ONE;
        for (int i = 0; i < k; i++) {
            x = x.multiply(BigInteger.valueOf(n-i)).divide(BigInteger.valueOf(i+1));
        }
        return x;
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt(); // num experiments
        for (int i = 0; i < t; i++) { // t experiments
            int n = in.nextInt(); // number of houses
            int k = in.nextInt(); // number of girlfriends
            // there are (n - k + 1) choose (k) ways to visit
            BigInteger num = choose(n-k+1,k);
            // mod 100003
            BigInteger modder = new BigInteger("100003");
            num = num.mod(modder);
            System.out.println(num);
        }
    }
}