B'You are given an array of length 2^n . The elements of the array are numbered from 1 to 2^n . You have to process q queries to this array. In the i -th query, you will be given an integer k ( 0 <= k <= n-1 ). To process the query, you should do the following: For example, if the array a is [-3, 5, -3, 2, 8, -20, 6, -1] , and k = 1 , the query is processed as follows: So, the array becomes [-3, 2, -3, 5, 6, -1, 8, -20] . The subsegment with the maximum sum is [5, 6, -1, 8] , and the answer to the query is 18 . Note that the queries actually change the array, i. xe2 x80 x89e. after a query is performed, the array does not return to its original state, and the next query will be applied to the modified array. The first line contains one integer n ( 1 <= n <= 18 ). The second line contains 2^n integers a_1, a_2, ... , a_{2^n} ( -10^9 <= a_i <= 10^9 ). The third line contains one integer q ( 1 <= q <= 2 cdot 10^5 ). Then q lines follow, the i -th of them contains one integer k ( 0 <= k <= n-1 ) describing the i -th query. For each query, print one integer -- the maximum sum over all contiguous subsegments of the array (including the empty subsegment) after processing the query. Transformation of the array in the example: [-3, 5, -3, 2, 8, -20, 6, -1] rightarrow [-3, 2, -3, 5, 6, -1, 8, -20] rightarrow [2, -3, 5, -3, -1, 6, -20, 8] rightarrow [5, -3, 2, -3, -20, 8, -1, 6] . '...