from the start, Polycarp is in the 1-st position and acquires 1 tugrik. Presently he has 1 tugrik; On the subsequent day, Polycarp is in the 1-st position and move to the 2-nd position. Presently he has 0 tugriks; On the third day, Polycarp is in the 2-nd position and procures 3 tugriks. Presently he has 3 tugriks;
Correct answer will be upvoted else downvoted. Computer science.
Right from the start, Polycarp is in the 1-st position and acquires 1 tugrik. Presently he has 1 tugrik;
On the subsequent day, Polycarp is in the 1-st position and move to the 2-nd position. Presently he has 0 tugriks;
On the third day, Polycarp is in the 2-nd position and procures 3 tugriks. Presently he has 3 tugriks;
On the fourth day, Polycarp is in the 2-nd position and is moved to the 3-rd position. Presently he has 1 tugriks;
On the fifth day, Polycarp is in the 3-rd position and procures 10 tugriks. Presently he has 11 tugriks;
On the 6th day, Polycarp is in the 3-rd position and procures 10 tugriks. Presently he has 21 tugriks;
After six days, Polycarp can get himself another PC.
Track down the base number of days after which Polycarp will actually want to get himself another PC.
Input
The principal line contains a solitary integer t (1≤t≤104). Then, at that point, t experiments follow.
The primary line of each experiment contains two integers n and c (2≤n≤2⋅105, 1≤c≤109) — the number of positions in the organization and the expense of another PC.
The second line of each experiment contains n integers a1≤a2≤… ≤an (1≤
The third line of each experiment contains n−1 integer b1,b2,… ,bn−1 (1≤bi≤109).
It is ensured that the amount of n over all experiments doesn't surpass 2⋅105.
Output
For each experiment, output the base number of days after which Polycarp will actually want to purchase another PC.
Step by step
Solved in 3 steps with 1 images
