#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

long long p = 100003, m, n;  
long long Pow(long long a,long long b)  {  
    long long ans=1;  
    while(b){  
        if(b&1){  
            b--;  
            ans=(ans*a)%p;  
        }  
        else{  
            b/=2;  
            a=(a*a)%p;  
        }  
    }  
    return ans;  
}  
long long C(long long n,long long m){  
    if(n<m)  
        return 0;  
    long long ans=1;  
    for(int i=1;i<=m;i++){  
        ans=ans*(((n-m+i)%p)*Pow(i,p-2)%p)%p;  
    }  
    return ans;  
}  

long long Lucas(long long n, long long m){  
    if(m==0)  
        return 1;  
    return Lucas(n/p,m/p)*C(n%p,m%p)%p;  
} 

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
  int num = 0;
  cin >> num;
  for (int i = 0; i < num; ++i) {
    cin >> n;
    cin >> m;
    cout << Lucas(n - m + 1, m) << endl; 
  }
  return 0;
}