“阿里巴巴集团杯”ACMICPC校内程序设计精英赛  热身赛
From: 20110428 09:00:00
To: 20110428 21:00:00
Now: 20170920 01:09:44
Status: Public
H  SnowWolf
Time Limit: 5s
Memory Limit: 64MB
Submissions: 456 Solved: 132
 Description
 After retired from hustacm, Sempr(Liangjing Wang) find a parttimejob in Snowwolf(Wei Xu)'s wine shop. There are different qualities of wine in the shop, and all of which has a rating describing the qualities. All the ratings are larger than 0 and smaller than 1,000,000. Everyday nearly Q people will go to his shop and buy a bottle of wine because of his kindness. Once a customer want an X qualified rating but there are no such one, Sempr will sell him a better one with the smallest rating. But the boss of the shop is Snowwolf, you know, so if no wine has no more than Y qualified ratings better than the customer's request, Sempr will say sorry to them. Every morning, Xiangsanzi will send N bottles of different or same qualified wine.
 Input
 In the first line there is an Integer T(0<T<10), which means the number of test cases in the test file, then followed by T test cases.
For each test case;
In the first line, there are 3 Integers, N,Q and Y.
In the second line, there are N integers, which means the quality rating of each bottle of wines.
In the third line, there are Q integers, which means the requests of customers from dawn to dark.
Here, all the Integers are between 0 and 1,000,000
 Output
 For each test case, output "Case I:", where I is the case number, then followed by Q different lines of integers, means the quality of wine Sempr will sell that time. If he could not sell any wine, just output 1.
 Sample Input

2
2 3 3
2 3
1 2 3
2 3 0
2 3
3 1 2
 Sample Output

Case 1:
2
3
1
Case 2:
3
1
2
 Hint
 Source
 SemprCrazyBirdhust07p43