#include <bits/stdc++.h>
using namespace std;
const int mod = 7340033;
const long long root = 2187;
const long long root_1 = 4665133;
const long long root_pw = 1 << 20;
long long getmod(long long a, long long mod) { return (a % mod + mod) % mod; }
long long powmod(long long a, long long b, long long m) {
  if (b == 0) return 1;
  long long c = powmod(a, b / 2, m);
  c = c * c % m;
  if (b & 1) c = c * a % m;
  return c;
}
void ntt(vector<long long> &a, bool invert) {
  int n = a.size();
  for (int i = 1, j = 0; i < n; i++) {
    int bit = n / 2;
    for (; j >= bit; bit /= 2) {
      j -= bit;
    }
    j += bit;
    if (i < j) swap(a[i], a[j]);
  }
  for (int len = 2; len <= n; len *= 2) {
    long long wlen = invert ? root_1 : root;
    for (int i = len; i < root_pw; i *= 2) {
      wlen = wlen * wlen % mod;
    }
    for (int i = 0; i < n; i += len) {
      long long w = 1;
      for (int j = 0; j < len / 2; j++) {
        long long u = a[i + j], v = a[i + j + len / 2] * w % mod;
        a[i + j] = getmod(u + v, mod);
        a[i + j + len / 2] = getmod(u - v, mod);
        w = w * wlen % mod;
      }
    }
  }
  if (invert) {
    long long nrev = powmod(n, mod - 2, mod);
    for (int i = 0; i < n; i++) {
      a[i] = (int)(a[i] * 1ll * nrev % mod);
    }
  }
}
void multiply(vector<long long> &a, vector<long long> &b,
              vector<long long> &c) {
  vector<long long> fa(a.begin(), a.end()), fb(b.begin(), b.end());
  int n = 1;
  while (n < 2 * max(a.size(), b.size())) n *= 2;
  fa.resize(n);
  fb.resize(n);
  ntt(fa, false);
  ntt(fb, false);
  for (int i = 0; i < n; i++) fa[i] *= fb[i] % mod;
  ntt(fa, true);
  c.resize(n);
  for (int i = 0; i < n; i++) c[i] = fa[i] % mod;
}
int MN = 29;
int MK = 1001;
vector<vector<long long> > dp(MN + 2, vector<long long>(MK, 0));
vector<long long> d;
void init() {
  int m;
  for (int i = 0; i < MN; i++) {
    dp[i][0] = 1;
    multiply(dp[i], dp[i], d);
    d.resize(MK);
    multiply(d, d, dp[i + 1]);
    dp[i + 1].insert(dp[i + 1].begin(), 0);
    dp[i + 1].resize(MK);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  init();
  int q;
  cin >> q;
  while (q--) {
    long long n, k;
    cin >> n >> k;
    int iter = 0;
    while (n > 1 && n & 1) iter++, n /= 2;
    cout << dp[iter][k] << endl;
  }
  return 0;
}
