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

public class Solution
{
	static BigInteger binomial(final long N, final long K) {
	    BigInteger ret = BigInteger.ONE;
	    for (int k = 0; k < K; k++) {
	        ret = ret.multiply(BigInteger.valueOf(N-k))
	                 .divide(BigInteger.valueOf(k+1));
	    }
	    return ret;
	}

	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		int T;
		T = in.nextInt();
		for (int i = 0; i < T; i++)
		{
			long N, K;
			N = in.nextLong();
			K = in.nextLong();
			if (N < K*2-1)
				System.out.println("0");
			else
			{
				System.out.println(binomial((N - K - K + 1) + K, K ).mod(BigInteger.valueOf(100003)));
			}
		}
	}
}