#include <bits/stdc++.h>

using namespace std;

#define MOD 1300031

typedef long long ll;

ll fexp(ll a, ll b){
    if(b==0) return 1;
    if(b==1) return a;
    if(b%2==0) return fexp((a*a)%MOD, b/2);
    else return (fexp((a*a)%MOD, (b-1)/2) * a)%MOD;
}

int main(){
    int k;
    cin >> k;
    ll n, c;
    ll up;
    ll resp=1;
    for(int i=0; i<k; i++){
        resp = 1;
        cin >> n >> c;
        up = n+c-1;
        if(up==c){
            cout << 1 << endl;
            continue;
        }
        if(up >= MOD){
            cout << 0 << endl;
            continue;
        }
        for(ll i=up; i>up-min(n-1, c); i--){
            resp = (resp*i)%MOD;
        }
        for(ll i=2; i<=min(n-1, c); i++){
            resp = (resp*fexp(i, MOD-2))%MOD;
        }
        cout << resp << endl;
    }


}