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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int T, n, k;
    cin >> T;
    while (T--) {
        cin >> n >> k;
        vector<vector<int> > dp(n + 1, vector<int>(k + 1, 0));
        for (int i = 1; i <= n; i++) {
            dp[i][0] = 1;
            dp[i][1] = i;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 2; j < i && j <= k ; j++) {
                dp[i][j] = (dp[i - 1][j] + dp[i - 2][j - 1]) % 100003;
            }
        }
        cout << dp[n][k] <<endl;
    }
    
    return 0;
}