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

// fast pow, square product if possible
int pow(long long a, long long k, int p) {
    long long prod = 1;
    long long mult = a;

    while (k) {
        if (k % 2 == 1) {
            prod = (prod * mult) % p;
        }
        k /= 2;
        mult = (mult * mult) % p;
    }
    return (int) prod;
}

int nCrm(long long n, long long k, int p) {
    long long ncrm = 1;
    for (long long i = n; i > n - k; --i) {
        long long f = i;
        while (f % p == 0) {
            f /= p;
        }
        ncrm = (ncrm * f) % p;
    }
    for (long long i = 1; i <= k; ++i) {
        long long f = i;
        while (f % p == 0) {
            f /= p;
        }
        // a^(-1) = a^(p - 2) mod p
        ncrm = (ncrm * pow(f, p - 2, p)) % p;
    }
    return ncrm;
}

int main() {
    int num_tests; cin >> num_tests;
    for (int t = 0; t < num_tests; ++t) {
        long long n, k; cin >> n >> k;
        if (n - k + 1 < k) cout << 0 << endl;
        else cout << nCrm(n - k + 1, k, 100003) << endl;
    }
    return 0;
}