#include <bits/stdc++.h>
const long long p = 7340033;
template <class t>
inline void read(t &s) {
  s = 0;
  register long long f = 1;
  register char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) s = (s << 3) + (s << 1) + (c ^ 48), c = getchar();
  s *= f;
  return;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0) putchar('-'), x = -x;
  long long buf[21], top = 0;
  while (x) buf[++top] = x % 10, x /= 10;
  if (!top) buf[++top] = 0;
  while (top) putchar(buf[top--] ^ '0');
  return;
}
inline void setIn(std::string s) {
  freopen(s.c_str(), "r", stdin);
  return;
}
inline void setOut(std::string s) {
  freopen(s.c_str(), "w", stdout);
  return;
}
inline void setIO(std::string s = "") {
  setIn(s + ".in");
  setOut(s + ".out");
  return;
}
template <class t>
inline bool checkmin(t &x, t y) {
  if (x > y) {
    x = y;
    return 1;
  }
  return 0;
}
template <class t>
inline bool checkmax(t &x, t y) {
  if (x < y) {
    x = y;
    return 1;
  }
  return 0;
}
inline long long lowbit(long long x) { return x & (-x); }
long long f[31][1050], g[1050], h[1050];
inline void work() {
  long long n, k;
  read(n, k);
  register long long m = 1;
  for (; (n > 1) && (n & 1); n >>= 1, ++m)
    ;
  write(f[m][k]), std::puts("");
}
signed main(void) {
  f[1][0] = 1;
  for (long long i = 2; i < 31; ++i) {
    std::memcpy(g, f[i - 1], sizeof g);
    std::memset(h, 0, sizeof h);
    for (long long j = 0; j < 1050; ++j)
      for (long long k = 0; j + k < 1050; ++k)
        (h[j + k] += g[j] * f[i - 1][k] % p) %= p;
    std::memcpy(g, h, sizeof g);
    std::memset(h, 0, sizeof h);
    for (long long j = 0; j < 1050; ++j)
      for (long long k = 0; j + k < 1050; ++k)
        (h[j + k] += g[j] * f[i - 1][k] % p) %= p;
    std::memcpy(g, h, sizeof g);
    std::memset(h, 0, sizeof h);
    for (long long j = 0; j < 1050; ++j)
      for (long long k = 0; j + k + 1 < 1050; ++k)
        (h[j + k + 1] += g[j] * f[i - 1][k] % p) %= p;
    std::memcpy(f[i], h, sizeof h);
    f[i][0] = 1;
  }
  long long t;
  read(t);
  while (t--) work();
  return 0;
}
