#include <bits/stdc++.h>
using namespace std;
const int MOD = 7340033;
const int M = 1 << 11;
const int K = 10;
const int G = 3;
int f[32][32][M], c[M], d[M], g[K + 1], ng[K + 1], pos[M];
int Pow(int x, int y) {
  int t = 1;
  for (; y; y >>= 1, x = (long long)x * x % MOD)
    if (y & 1) t = (long long)t * x % MOD;
  return t;
}
void ntt(int a[], int n, int t) {
  for (int i = 1; i < n - 1; ++i)
    if (pos[i] > i) swap(a[i], a[pos[i]]);
  for (int k = 0; 1 << k < n; ++k) {
    int d = 1 << k, _w = t == 1 ? g[k] : ng[k];
    for (int i = 0; i < n; i += d + d) {
      for (int w = 1, j = 0; j < d; ++j) {
        int &A = a[i + j], &B = a[i + j + d], C = (long long)w * B % MOD;
        B = A - C;
        if (B < 0) B += MOD;
        A = A + C;
        if (A >= MOD) A -= MOD;
        w = (long long)w * _w % MOD;
      }
    }
  }
  int inv = Pow(n, MOD - 2);
  if (t == -1)
    for (int i = 0; i < n; ++i) a[i] = (long long)a[i] * inv % MOD;
}
void work(int a[], int b[], int n) {
  for (int i = 0; i < M; ++i) c[i] = b[i];
  ntt(c, M, 1);
  for (int j = 0; j < 4; ++j) {
    ntt(a, M, 1);
    for (int i = 0; i < M; ++i) a[i] = (long long)a[i] * c[i] % MOD;
    ntt(a, M, -1);
    for (int i = 1001; i < M; ++i) a[i] = 0;
  }
}
int main() {
  int i, j;
  g[K] = Pow(G, (MOD - 1) / M);
  ng[K] = Pow(g[K], MOD - 2);
  for (i = K - 1; ~i; --i) {
    g[i] = (long long)g[i + 1] * g[i + 1] % MOD;
    ng[i] = (long long)ng[i + 1] * ng[i + 1] % MOD;
  }
  for (i = 0; i < M; ++i) pos[i] = pos[i >> 1] >> 1 | ((i & 1) << K);
  for (i = 1; i < 32; ++i) {
    f[i][i][0] = 1;
    for (j = i - 1; j; --j) {
      f[i][j][1]++;
      work(f[i][j], f[i][j + 1], M);
      f[i][j][0]++;
    }
  }
  int qq;
  scanf("%d", &qq);
  for (; qq--;) {
    int n, k;
    scanf("%d%d", &n, &k);
    for (i = 1; n % 2 == 1 && n > 1; n /= 2) ++i;
    printf("%d\n", f[i][1][k]);
  }
  return 0;
}
