B"Let's call an array a of n non-negative integers fancy if the following conditions hold: You are given n , x and k . Your task is to calculate the number of fancy arrays of length n . Since the answer can be large, print it modulo 10^9+7 . The first line contains a single integer t ( 1 <= t <= 50 ) -- the number of test cases. The only line of each test case contains three integers n , x and k ( 1 <= n, k <= 10^9 ; 0 <= x <= 40 ). For each test case, print a single integer -- the number of fancy arrays of length n , taken modulo 10^9+7 . In the first test case of the example, the following arrays are fancy: "...