#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 2400
using namespace std;
typedef long long ll;
const ll mod = 2333;
ll c[N][N] , sum[N][N];
void init()
{
ll i , j;
for(i = 0 ; i <= mod ; i ++ )
{
c[i][0] = sum[i][0] = 1;
for(j = 1 ; j <= i ; j ++ ) c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
for(j = 1 ; j <= mod ; j ++ ) sum[i][j] = (sum[i][j - 1] + c[i][j]) % mod;
}
}
ll choose(ll n , ll m)
{
if(n < m) return 0;
if(n < mod && m < mod) return c[n][m];
return choose(n / mod , m / mod) * choose(n % mod , m % mod) % mod;
}
ll calc(ll n , ll k)
{
if(k < mod) return sum[n % mod][k % mod];
return (sum[n % mod][mod - 1] * calc(n / mod , k / mod - 1) + choose(n / mod , k / mod) * calc(n % mod , k % mod)) % mod;
}
int main()
{
init();
int T;
ll n , k;
scanf("%d" , &T);
while(T -- ) scanf("%lld%lld" , &n , &k) , printf("%lld\n" , calc(n , k));
return 0;
}