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

public class Solution {
    
    public static BigInteger MODULO = new BigInteger("100003");

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int numTests = in.nextInt();

        for (int i = 0; i < numTests; i++) {
            BigInteger n = BigInteger.valueOf(in.nextInt());
            BigInteger r = BigInteger.valueOf(in.nextInt());

            System.out.println(findNumberOfWays(n, r));
        }
    }

    public static BigInteger findNumberOfWays(BigInteger n, BigInteger r) {
        if (n.divide(new BigInteger("2")).compareTo(r) < 0) {
            return BigInteger.ZERO;
        }

        BigInteger num = n.subtract(r).add(BigInteger.ONE);
        BigInteger den = r;

        BigInteger top = factorialMod(num, den, MODULO);
        BigInteger bot = factorialMod(num.subtract(den), BigInteger.ONE, MODULO).modInverse(MODULO);

        return (top.multiply(bot)).mod(MODULO);
    }

    public static BigInteger factorialMod(BigInteger num, BigInteger den, BigInteger mod) {
        BigInteger value = BigInteger.ONE;
        for (long i = den.longValue() + 1; i <= num.longValue(); i++) {
            value = (value.multiply(BigInteger.valueOf(i))).mod(mod);
        }

        return value.mod(mod);
    }

}