All Right

You are given an array of integers and k moves. Your target is to maximize the rightmost element of the array. In one move you can choose an index i if a[i]>=2 and then replace a[i] by a[i]-2 and a[i+1] by a[i+1]+2. Print the maximized value of the rightmost element of the array. Constraints Sum of values of n over all the testcases, doesn't exceed 10^6. 1<=t<=100 1<=n<=10^6 1<=k