B"In this task, Nastya asked us to write a formal statement. An array a of length n and an array k of length n-1 are given. Two types of queries should be processed: It's guaranteed that initially a_i + k_i <= q a_{i+1} for all 1 <= q i <= q n-1 . The first line contains a single integer n ( 2 <= q n <= q 10^{5} ) -- the number of elements in the array a . The second line contains n integers a_1, a_2, ldots, a_n ( -10^{9} <= q a_i <= q 10^{9} ) -- the elements of the array a . The third line contains n-1 integers k_1, k_2, ldots, k_{n-1} ( -10^{6} <= q k_i <= q 10^{6} ) -- the elements of the array k . The fourth line contains a single integer q ( 1 <= q q <= q 10^{5} ) -- the number of queries. Each of the following q lines contains a query of one of two types: For each query of the second type print a single integer in a new line -- the sum of the corresponding subarray. In the first example: In the second example: "...