#include <cstdio>
#include <iostream>

using namespace std;

typedef long long ll;

const ll MOD=100003;
ll factorial_exponent(ll n)
{
	ll ex = 0;
	do
	{
		n /= MOD;
		ex += n;
	}while(n > 0);
	return ex;
}

ll invert_mod(ll a, ll b){
	b-=2;
	ll x = 1, y = a;
	while(b > 0){
		if(b%2 == 1){
			x=(x*y);
			if(x>MOD) x%=MOD;
		}
		y = (y*y);
		if(y>MOD) y%=MOD;
		b /= 2;
	}
	return x;
}


ll choose_mod_two(ll n, ll k)
{
	n %= MOD;
	if (n < k) return 0;
	if (k == 0 || k == n) return 1;
	if (k > n/2) k = n-k;
	ll num = n, den = 1;
	for(n = n-1; k > 1; n--, k--)
	{
		num = (num * n) % MOD;
		den = (den * k) % MOD;
	}
	den = invert_mod(den,MOD);
	return (num * den) % MOD;
}

ll choose_mod_one(ll n, ll k){

	if (k < MOD) return choose_mod_two(n,k);
	ll q_n, r_n, q_k, r_k, choose;
	q_n = n / MOD;
	r_n = n % MOD;
	q_k = k / MOD;
	r_k = k % MOD;
	choose = choose_mod_two(r_n, r_k);
	choose *= choose_mod_one(q_n, q_k);
	return choose % MOD;
}

ll choose_mod(ll n, ll k){
	//cout<<n<<' '<<k<<endl;
	if (k < 0 || n < k) return 0;
	if (k == 0 || k == n) return 1;

	//if (factorial_exponent(n) > factorial_exponent(k) + factorial_exponent(n-k)) return 0;
	return choose_mod_one(n,k);
}

ll T, N, K;
int main(){
	cin>>T;
	for(int i=0; i<T; i++){
		cin>>N>>K;
		cout<<choose_mod(N-K+1, K)<<endl;
	}

}