def bs(a, i):
low = 0
high = len(a) - 1
res = -1
while low <= high:
mid = (low + high) // 2
if a[mid] <= i:
low = mid + 1
res = mid
else:
high = mid - 1
return res
for _ in range(int(input())):
n,k,q = [int(x) for x in input().split()]
a = [0] + [int(x) for x in input().split()]
b = [0] + [int(x) for x in input().split()]
d = []
for i in range(q):
d.append(int(input()))
res = []
for i in d:
x = bs(a, i)
if a[x] == a[-1]:
res.append(b[x])
else:
res.append((b[x] + (i-a[x]) * (b[x+1]- b[x]) // (a[x+1]- a[x])))
print(*res)
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |