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 JAVA):

Solution:
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

public class Main {

	public static void main(String[] args) throws IOException {
		new Main().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st = new StringTokenizer("");

	private void run() throws IOException {
		if (new File("input.txt").exists())
			in = new BufferedReader(new FileReader("input.txt"));
		else
			in = new BufferedReader(new InputStreamReader(System.in));
		if (new File("output.txt").exists())
			out = new PrintWriter("output.txt");
		else
			out = new PrintWriter(System.out);

		solve();

		in.close();
		out.close();
	}

	final int MAX_N = Integer.MAX_VALUE / 2 - 1;
	final int MAX_LOGN = 32;
	final int MAX_K = 1111;
	final long MOD = 7340033;
	final long ROOT = 5;
	final long INV_ROOT = 4404020;
	final int ROOT_POW = 1 << 20;

	long p[][] = new long[MAX_LOGN][MAX_K];

	void fft(long a[], int n, boolean inverse) {
		for (int i = 1, j = 0; i < n; i++) {
			int bit = n >> 1;
			while (j >= bit) {
				j ^= bit;
				bit >>= 1;
			}
			j |= bit;
			
			if (i < j) {
				long swap = a[i];
				a[i] = a[j];
				a[j] = swap;
			}
		}

		for (int len2 = 2; len2 <= n; len2 <<= 1) {
			final int len = len2 >> 1;
			for (int i = 0; i < n; i += len2) {

				long wlen = inverse ? INV_ROOT : ROOT;
				for (int p = len2; p < ROOT_POW; p <<= 1)
					wlen = (wlen * wlen) % MOD;
				long w = 1;

				for (int j = 0; j < len; j++) {
					long u = a[i + j], v = a[i + j + len];
					a[i + j] = (u + v * w) % MOD;
					a[i + j + len] = (MOD + (u - v * w) % MOD) % MOD;
					w = (w * wlen) % MOD;
				}
			}
		}

		if (inverse) {
			long invn = BigInteger.valueOf(n).modInverse(BigInteger.valueOf(MOD)).longValue();
			for (int i = 0; i < n; i++)
				a[i] = (a[i] * invn) % MOD;
		}
	}

	long fa[] = new long[8 * MAX_K];

	void pow4(long a[], int na, long ans[], int nAns) {
		int n = 1;
		while (n < na)
			n <<= 1;
		n <<= 2;

		fill(fa, 0);
		for (int i = 0; i < na; i++)
			fa[i] = a[i];
		fft(fa, n, false);
		for (int i = 0; i < n; i++) {
			long tmp = (fa[i] * fa[i]) % MOD;
			fa[i] = (tmp * tmp) % MOD;
		}
		fft(fa, n, true);

		for (int i = 0; i < nAns; i++)
			ans[i] = fa[i];
	}

	void precalc() {
		p[0][0] = 1;
		p[1][0] = p[1][1] = 1;

		for (int n = 2; n < MAX_LOGN; n++) {
			pow4(p[n - 1], MAX_K, p[n], MAX_K);
			for (int i = MAX_K - 1; i > 0; i--)
				p[n][i] = p[n][i - 1];
			p[n][0] = 1;
		}
		
//		for (int i = 0; i < 10; i++)
//			System.err.println(p[2][i]);
	}

	// void precalc() {
	// p[0][0] = 1;
	// p[1][0] = p[1][1] = 1;
	//
	// for (int n = 1; n < MAX_LOGN - 1; n++) {
	// fill(temp, 0);
	// for (int i = 0; i < MAX_K; i++)
	// for (int l = 0, r = i; r >= 0; l++, r--)
	// temp[i] = (temp[i] + p[n][l] * p[n][r]) % MOD;
	// for (int i = 0; i < MAX_K; i++)
	// for (int l = 0, r = i; r >= 0; l++, r--)
	// p[n + 1][i] = (p[n + 1][i] + temp[l] * temp[r]) % MOD;
	// for (int i = MAX_K - 1; i > 0; i--)
	// p[n + 1][i] = p[n + 1][i - 1];
	// p[n + 1][0] = 1;
	// }
	// }

	void solve() throws IOException {
		precalc();
		int q = nextInt();
		for (int i = 0; i < q; i++) {
			int n = nextInt();
			// System.err.println(n);
			int k = nextInt();
			// n = max(0, Integer.bitCount(Integer.lowestOneBit(n) - 1) - 1);
			int t = 0;
			while ((n & 1) == 1 && n > 2) {
				t++;
				n >>= 1;
			}

			// System.err.println(t);

			long ans = p[t][k];
			out.println(ans);
		}
	}

	String nextLine() throws IOException {
		st = new StringTokenizer("");
		return in.readLine();
	}

	String nextToken() throws IOException {
		while (!st.hasMoreTokens()) {
			st = new StringTokenizer(in.readLine());
		}
		return st.nextToken();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	boolean EOF() throws IOException {
		while (!st.hasMoreTokens()) {
			String str = in.readLine();
			if (str == null)
				return true;
			st = new StringTokenizer(str);
		}
		return false;
	}

}