B'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. Vasily the bear wants to paint his square table in exactly k moves. Each move is sequence of actions: 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. The first line contains integer q (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89q xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of test data. Each of the following q lines contains two integers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109, xe2 x80 x890 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891000) -- the size of the initial table and the number of moves for the corresponding test. 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. All possible painting ways for the test n xe2 x80 x89= xe2 x80 x897 and k xe2 x80 x89= xe2 x80 x892 are:'...