#include <iostream>
#include<algorithm>
#include<vector>
#include <string>
#include <utility>
#include <queue>
#include <stack>
#define MODULO 100003
using namespace std;
int find(vector<vector <int> > &v, int n, int k)
{
    int sum = 0;
    for (int i=1;i<=(n-((k-1)*2));i++)
    {
        if(n-(1+i) >= k-1 && k-1 > 0 && n-(1+i) > 0)
        {   
            if(v[(n-(1+i))][(k-1)] == -1)
            {
                sum = (sum + find(v, (n-(1+i)), (k-1)))%MODULO;
                //cout<<"i:"<<i<<" n-(1+i):"<<n-(1+i)<<" k-1:"<<k-1<<endl;
            }
            else
                sum = (sum + v[(n-(1+i))][(k-1)])%MODULO;
        }
    }
    return sum;
    
}
int main()
{
    
    int t;
    cin>>t;
    for(int x=0;x<t;x++)
    {
        int n, k;
        cin>>n>>k;
        vector<vector <int> > v;
        for(int i=0;i<n;i++)
        {
            vector <int> temp(n-1, -1);
            v.push_back(temp);
        }
        v[1][1] = 1;
        v[2][1] = 2;
        v[3][1] = 3;
        v[3][2] = 1;

        cout<<find(v,n,k)<<endl;   
    }
}