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) {
        Scanner in = new Scanner(System.in);
        
        int T = in.nextInt();
        for (int t = 0; t < T; t++){
            int n = in.nextInt();
            int k = in.nextInt();
            System.out.println(choose(n-k+1, k));
        }
    }
    static long choose (long n, long k) {
        BigInteger res = BigInteger.valueOf (1);
        if ((2*k) > n) choose(n, n-k);
        for (int i=1; i<=k; n--, i++) {
            res = (res.multiply (BigInteger.valueOf(n))).divide (BigInteger.valueOf (i));
        }
        return (res.remainder(BigInteger.valueOf(100003))).longValue();
    }
}