Polycarp needs to dive deeper into the activity of the drive, however he has definitely no spare energy. So he posed you m inquiries. To answer the I-th of them, you really want to find how long the drive will function if you give it xi as input. If it's not too much trouble, note that at times the drive can work limitlessly. For instance, assuming n=3,m=3, a=[1,−3,4] and x=[1,5,2],
Correct answer will be upvoted else downvoted. Computer science.
Polycarp needs to dive deeper into the activity of the drive, however he has definitely no spare energy. So he posed you m inquiries. To answer the I-th of them, you really want to find how long the drive will function if you give it xi as input. If it's not too much trouble, note that at times the drive can work limitlessly.
For instance, assuming n=3,m=3, a=[1,−3,4] and x=[1,5,2], the responses to the inquiries are as per the following:
the response to the main inquiry is 0 on the grounds that the drive at first focuses to the primary thing and the underlying total is 1.
the response to the subsequent inquiry is 6, the drive will turn the circle totally twice and the sum becomes 1+(−3)+4+1+(−3)+4+1=5.
the response to the third question is 2, the sum is 1+(−3)+4=2.
Input
The principal line contains one integer t (1≤t≤104) — the number of experiments. Then, at that point, t experiments follow.
The main line of each experiment comprises of two positive integers n, m (1≤n,m≤2⋅105) — the number of numbers on the plate and the number of posed inquiries.
The second line of each experiment contains n integers a1,a2,… ,an (−109≤
The third line of each experiment contains m positive integers x1,x2,… ,xm (1≤x≤109).
It is ensured that the amounts of n and m over all experiments don't surpass 2⋅105.
Output
Print m numbers on a different line for each experiment. The I-th number is:
−1 if the drive will run vastly;
the number of seconds the drive will run, in any case.
Step by step
Solved in 4 steps with 1 images
