/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define ull unsigned long long
#define mod 666013
#define MOD 32416190071
#define N 100100
#define M 5500010
#define SQR 350
#define inf 1<<30
#define eps 1.e-4
using namespace std;

ifstream f("aurel.in");
ofstream g("aurel.out");

int D[N],T,n,S;


int main ()
{
    f>>T;
    while(T--)
    {
        f>>n>>S;
        S-=n*(n+1)/2;
        if(S<0)
        {
            g<<"0\n";
        }
        FOR(i,0,S)
        D[i]=1;
        FOR(k,2,n)
        {
            FOR(j,0,S)
            {
                if(j>=k)
                    D[j]+=D[j-k];
                if(D[j]>=mod)
                    D[j]-=mod;
            }
        }
        g<<D[S]<<"\n";
    }
    return 0;
}