//package BackToSchoolCodeSprint;

import java.util.*;
public class Solution {
	static long mod=100003;
	static long bin_pow(long a, long x)
	{
		if(x==0) return 1;
		long res=bin_pow(a,x/2);
		res=(res*res)%mod;
		
		if(x%2!=0)res*=a;
		res%=mod;
		return res;
	}
	static long inverse(long x)
	{
		return bin_pow(x,mod-2);
	}
	
	static long ncr(long n, long k) {

	    long num = 1,den=1; 
	    for (int i=0; i<k; i++)  num = (num * (n-i) ) % mod;
	    for (int i=1; i<=k; i++) den = (den * i) % mod;
	        
	    return ( num* inverse(den) ) % mod;
	}
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int t=sc.nextInt();
		while(t-- > 0)
		{
			long n=sc.nextLong();
			long r=sc.nextLong();
			long out=ncr(n-r+1,r);
			System.out.println(out);
		}
	}

}