Problem Description

Arcueid likes nya number very much. A nya number is the number which has exactly X fours and Y sevens(If X=2 and Y=3 , 172441277 and 47770142 are nya numbers.But 14777 is not a nya number ,because it has only 1 four). Now, Arcueid wants to know the K-th nya number which is greater than P and not greater than Q.

Input 

The first line contains a positive integer T (T<=100), indicates there are T test cases.  The second line contains 4 non-negative integers: P,Q,X and Y separated by spaces.  ( 0<=X+Y<=20 , 0< P<=Q <2^63)  The third line contains an integer N(1<=N<=100).  Then here comes N queries.  Each of them contains an integer K_i (0<K_i <2^63).

Output

For each test case, display its case number and then print N lines.  For each query, output a line contains an integer number, representing the K_i-th nya number in (P,Q].  If there is no such number,please output "Nya!"(without the quotes). 

Sample Input

1 38 400 1 1 10 1 2 3 4 5 6 7 8 9 10

Sample Output

Case #1: 47 74 147 174 247 274 347 374 Nya! Nya!

————————————————————————————————————————————————————

題意：給定 x 和 y 的值，對於數位 4 出現 x 次，7 出現 y 次的數字稱為 nya 數，給定區間 [p,q]，查詢在區間上找到的第 k 個nya 數，如果不存在則輸出 Nya！

思路：

Source Program