B"Timur is in a car traveling on the number line from point 0 to point n . The car starts moving from point 0 at minute 0 . There are k+1 signs on the line at points 0, a_1, a_2, ... , a_k , and Timur knows that the car will arrive there at minutes 0, b_1, b_2, ... , b_k , respectively. The sequences a and b are strictly increasing with a_k = n . Between any two adjacent signs, the car travels with a constant speed. Timur has q queries: each query will be an integer d , and Timur wants you to output how many minutes it takes the car to reach point d , rounded down to the nearest integer. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The first line of each test case contains three integers n , k , and q , ( k <= q n <= q 10^9 ; 1 <= q k, q <= q 10^5 ) -- the final destination, the number of points Timur knows the time for, and the number of queries respectively. The second line of each test case contains k integers a_i ( 1 <= q a_i <= q n ; a_i < a_{i+1} for every 1 <= q i <= q k-1 ; a_k = n ). The third line of each test case contains k integers b_i ( 1 <= q b_i <= q 10^9 ; b_i < b_{i+1} for every 1 <= q i <= q k-1 ). Each of the following q lines contains a single integer d ( 0 <= q d <= q n ) -- the distance that Timur asks the minutes passed for. The sum of k over all test cases doesn't exceed 10^5 , and the sum of q over all test cases doesn't exceed 10^5 . For each query, output a single integer -- the number of minutes passed until the car reaches the point d , rounded down. For the first test case, the car goes from point 0 to point 10 in 10 minutes, so the speed is 1 unit per minute and: For the second test case, between points 0 and 4 , the car travels "...