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

const long long MOD = 100003LL;

long long powmod(long long n, long long p, long long MOD) {
   long long out = 1;
   n %= MOD;
   while(p) {
      if (p & 1) {
          out *= n;
          out %= MOD;
      }
      p /= 2;
      n *= n;
      n %= MOD;
   }
   return out;
}
 
long long ncr(long long n, long long r)
{
   long long num = 1;
   n %= MOD;
   if (n == r || r == 0) return 1;
   if (r > n || r < 0) return 0;
   for (int i=0; i < r; i++) {
      num *= n-i;
      num %= MOD;
   }
   long long den = 1;
   for (int i=1; i < r+1; i++) {
      den *= i;
      den %= MOD;
   }
   return (num * powmod(den, MOD-2, MOD)) % MOD;
}

int main() {
    long long T, houses, gfs;
    cin >> T;
    while (T--) {
        cin >> houses >> gfs;
        cout << ncr((houses-gfs+1), gfs) << endl;
    }
}