（dp）CodeForces

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.

 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.

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 ≤ 10⁵) — the number of test data.

Each of the following q lines contains two integers n and k (1 ≤ n ≤ 10⁹, 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.

Example

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:

这个题不仔细读题容易读错，首先必须分成正方形而非矩形，其次some row some column 指的是某一条行、列。

明确是分成正方形后显然可知，只有边长为奇数的的正方形才可以继续分下去。显然对于某边长x的正方形，每次只分其左上角的（初始时分整体），最多分 x二进制下末尾1的个数次。很自然的就可以想到一种递推。

用dp[i][j]表示边长为“i”（二进制下尾数1的个数）的正方形分j次的情况数。

dp[i][x]=∑（x1+x2+x3+x4=x xi>=0)dp[i-1][x1]*dp[i-1][x2]*dp[i-1][x3]*dp[i-1][x4]

这样一个∑还是比较麻烦，可以通过预处理（类似倍增的想法）先用an[x]表示对两个边长为i-1的正方向一共操作x次的情况数，显然an[x]=Σ（x1+x2=x,xi>=0)dp[i-1]*[x1]*dp[i-1][x2]

则dp[i][x]=Σ（x1+x2=x,xi>=0)an[x1]*an[x2] ，降低了原本n^3的复杂度为n^2（虽然n最大也不过30，影响可以忽略不计）

#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <vector>
#include <stack>
#define mp make_pair
//#define P make_pair
#define MIN(a,b) (a>b?b:a)
//#define MAX(a,b) (a>b?a:b)
typedef long long ll;
typedef unsigned long long ull;
const int MAX=1e3+5;
const int MAX_V=2e4+5;
const ll INF=2e11+5;
const double M=4e18;
using namespace std;
//const int MOD=1e9+7;
const ll MOD=7340033;
typedef pair<ll,int> pii;
const double eps=0.000000001;
#define rank rankk
int q,n,k,mi;
ll dp[31][MAX],num[MAX];
int main()
{
    scanf("%d",&q);
    dp[0][0]=1LL;
    for(int i=1;i<=30;i++)
    {
        dp[i][0]=1LL;
        memset(num,0,sizeof(num));
        for(int s=0;s<=1000;s++)
            for(int j=0;j<=1000-s;j++)
                num[s+j]=(num[s+j]+dp[i-1][s]*dp[i-1][j]%MOD)%MOD;
        for(int s=0;s<1000;s++)
            for(int j=0;j<1000-s;j++)
                dp[i][s+j+1]=(dp[i][s+j+1]+num[s]*num[j]%MOD)%MOD;
    }
    while(q--)
    {
        scanf("%d%d",&n,&k);
        mi=0;
        while(n>1&&(n&1))
            n>>=1,++mi;
        printf("%I64d
",dp[mi][k]);
    }
    return 0;
}