Problem: Vasily the bear has got a large square white table of n rows and n columns. The table has got a black border around this table.

<image> The example of the initial table at n = 5.

Vasily the bear wants to paint his square table in exactly k moves. Each move is sequence of actions:

  1. The bear chooses some square inside his table. At that the square must have a black border painted around it. Also, the square shouldn't contain a black cell. The number of cells in the square shouldn't be less than 2. 
  2. The bear chooses some row and some column inside the chosen square. Then he paints each cell of this row and this column inside the chosen square. After that the rectangles, formed by the square's border and the newly painted cells, must be squares of a non-zero area. 

<image> An example of correct painting at n = 7 и k = 2.

The bear already knows numbers n and k. Help him — find the number of ways to paint the square in exactly k moves. Two ways to paint are called distinct if the resulting tables will differ in at least one cell. As the answer can be rather large, print the remainder after dividing it by 7340033.

Input

The first line contains integer q (1 ≤ q ≤ 105) — the number of test data.

Each of the following q lines contains two integers n and k (1 ≤ n ≤ 109, 0 ≤ k ≤ 1000) — the size of the initial table and the number of moves for the corresponding test.

Output

For each test from the input print the answer to the problem modulo 7340033. Print the answers to the tests in the order in which the tests are given in the input.

Examples

Input

8
1 0
1 1
3 0
3 1
2 0
2 1
3 2
7 2


Output

1
0
1
1
1
0
0
4

Note

All possible painting ways for the test n = 7 and k = 2 are:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int mod = 7340033;
long long powmod(long long a, long long b) {
  long long res = 1;
  if (a >= mod) a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a;
    if (res >= mod) res %= mod;
    a = a * a;
    if (a >= mod) a %= mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
namespace FFT {
const int MAX = 3000;
const double PI = acos(-1);
int N;
complex<double> omega[MAX];
complex<double> a1[MAX], a2[MAX];
complex<double> z1[MAX], z2[MAX];
void fft(complex<double> *a, complex<double> *z, int m = N) {
  if (m == 1) {
    z[0] = a[0];
  } else {
    int s = N / m;
    m /= 2;
    fft(a, z, m);
    fft(a + s, z + m, m);
    for (int i = (0); i < (m); ++i) {
      complex<double> c = omega[s * i] * z[m + i];
      z[m + i] = z[i] - c;
      z[i] += c;
    }
  }
}
void mult(long long *a, long long *b, long long *c, int len) {
  N = 2 * len;
  while (N & (N - 1)) ++N;
  assert(N <= MAX);
  for (int i = (0); i < (N); ++i) a1[i] = 0;
  for (int i = (0); i < (N); ++i) a2[i] = 0;
  for (int i = (0); i < (len); ++i) a1[i] = a[i];
  for (int i = (0); i < (len); ++i) a2[i] = b[i];
  for (int i = (0); i < (N); ++i) omega[i] = polar(1.0, 2 * PI / N * i);
  fft(a1, z1, N);
  fft(a2, z2, N);
  for (int i = (0); i < (N); ++i) omega[i] = complex<double>(1, 0) / omega[i];
  for (int i = (0); i < (N); ++i) a1[i] = z1[i] * z2[i] / complex<double>(N, 0);
  fft(a1, z1, N);
  for (int i = (0); i < (2 * len); ++i) c[i] = round(z1[i].real());
}
void mult_mod(long long *a, long long *b, long long *c, int len, int mod) {
  static long long a0[MAX], a1[MAX];
  static long long b0[MAX], b1[MAX];
  static long long c0[MAX], c1[MAX], c2[MAX];
  for (int i = (0); i < (len); ++i) a0[i] = a[i] & 0xFFFF;
  for (int i = (0); i < (len); ++i) a1[i] = a[i] >> 16;
  for (int i = (0); i < (len); ++i) b0[i] = b[i] & 0xFFFF;
  for (int i = (0); i < (len); ++i) b1[i] = b[i] >> 16;
  FFT::mult(a0, b0, c0, len);
  FFT::mult(a1, b1, c2, len);
  for (int i = (0); i < (len); ++i) a0[i] += a1[i];
  for (int i = (0); i < (len); ++i) b0[i] += b1[i];
  FFT::mult(a0, b0, c1, len);
  for (int i = (0); i < (2 * len); ++i) c1[i] -= c0[i] + c2[i];
  for (int i = (0); i < (2 * len); ++i) c1[i] %= mod;
  for (int i = (0); i < (2 * len); ++i) c2[i] %= mod;
  for (int i = (0); i < (2 * len); ++i)
    c[i] = (c0[i] + (c1[i] << 16) + (c2[i] << 32)) % mod;
}
}  // namespace FFT
long long p[50][3000], temp[3000];
void compute() {
  int i, j;
  p[1][0] = 1;
  for (i = 2; i <= 35; i++) {
    FFT ::mult_mod(p[i - 1], p[i - 1], temp, 1002, mod);
    FFT ::mult_mod(temp, temp, temp, 1002, mod);
    for (j = 1000; j; j--) p[i][j] = temp[j - 1];
    p[i][0] = 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  ;
  cin.tie(0);
  int t, nn, k, n;
  cin >> t;
  compute();
  while (t--) {
    cin >> nn >> k;
    n = 0;
    while (nn & 1) {
      n = n * 2 + 1;
      nn = nn / 2;
    }
    if (nn) n = n * 2 + 1;
    assert(((n + 1) & n) == 0);
    n = log(n + 1) / log(2) + 0.5;
    cout << p[n][k] << '\n';
  }
  return 0;
}