Problem: Ralph is in the Binary Country. The Binary Country consists of n cities and (n - 1) bidirectional roads connecting the cities. The roads are numbered from 1 to (n - 1), the i-th road connects the city labeled <image> (here ⌊ x⌋ denotes the x rounded down to the nearest integer) and the city labeled (i + 1), and the length of the i-th road is Li.

Now Ralph gives you m queries. In each query he tells you some city Ai and an integer Hi. He wants to make some tours starting from this city. He can choose any city in the Binary Country (including Ai) as the terminal city for a tour. He gains happiness (Hi - L) during a tour, where L is the distance between the city Ai and the terminal city.

Ralph is interested in tours from Ai in which he can gain positive happiness. For each query, compute the sum of happiness gains for all such tours.

Ralph will never take the same tour twice or more (in one query), he will never pass the same city twice or more in one tour.

Input

The first line contains two integers n and m (1 ≤ n ≤ 106, 1 ≤ m ≤ 105).

(n - 1) lines follow, each line contains one integer Li (1 ≤ Li ≤ 105), which denotes the length of the i-th road.

m lines follow, each line contains two integers Ai and Hi (1 ≤ Ai ≤ n, 0 ≤ Hi ≤ 107).

Output

Print m lines, on the i-th line print one integer — the answer for the i-th query.

Examples

Input

2 2
5
1 8
2 4


Output

11
4


Input

6 4
2
1
1
3
2
2 4
1 3
3 2
1 7


Output

11
6
3
28

Note

Here is the explanation for the second sample.

Ralph's first query is to start tours from city 2 and Hi equals to 4. Here are the options:

  * He can choose city 5 as his terminal city. Since the distance between city 5 and city 2 is 3, he can gain happiness 4 - 3 = 1. 
  * He can choose city 4 as his terminal city and gain happiness 3. 
  * He can choose city 1 as his terminal city and gain happiness 2. 
  * He can choose city 3 as his terminal city and gain happiness 1. 
  * Note that Ralph can choose city 2 as his terminal city and gain happiness 4. 
  * Ralph won't choose city 6 as his terminal city because the distance between city 6 and city 2 is 5, which leads to negative happiness for Ralph. 



So the answer for the first query is 1 + 3 + 2 + 1 + 4 = 11.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
const int N = 1000005;
vector<long long> sto[N];
vector<long long> stosm[N];
int a[N], len[N];
void merge(int x, int y) {
  int i = 0, j = 0, k = 0, lx = sto[x].size(), ly = sto[y].size();
  int add = len[y];
  while (i < lx && j < ly) {
    if (sto[x][i] < sto[y][j] + add)
      a[k++] = sto[x][i++];
    else
      a[k++] = sto[y][j++] + add;
  }
  while (i < lx) a[k++] = sto[x][i++];
  while (j < ly) a[k++] = sto[y][j++] + add;
  for (i = 0; i < lx; i++) {
    sto[x][i] = a[i];
  }
  for (i = lx; i < k; i++) sto[x].push_back(a[i]);
}
long long calc(int cur, int lx) {
  int lo = 0, hi = sto[cur].size() - 1, mid;
  while (lo <= hi) {
    mid = (lo + hi) >> 1;
    if (sto[cur][mid] <= lx)
      lo = mid + 1;
    else
      hi = mid - 1;
  }
  if (hi < 0) return 0;
  return 1ll * lx * (hi + 1) - stosm[cur][hi];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m, i, j, k, las;
  scanf("%d%d", &n, &m);
  for (i = 2; i <= n; i++) scanf("%d", &len[i]);
  for (i = 1; i <= n; i++) sto[i].push_back(0);
  for (i = n; i >= 1; i--) {
    merge(i / 2, i);
  }
  for (i = 1; i <= n; i++) {
    for (j = 0, k = sto[i].size(); j < k; j++) {
      stosm[i].push_back(sto[i][j]);
      if (j) stosm[i][j] += stosm[i][j - 1];
    }
  }
  for (i = 1; i <= m; i++) {
    scanf("%d%d", &j, &k);
    long long cnt = 0;
    for (las = 0; j; k -= len[j], las = j, j >>= 1) {
      if (k < 0) break;
      cnt += k;
      int lt = j << 1, rt = j << 1 | 1;
      if (lt <= n && las != lt) cnt += calc(lt, k - len[lt]);
      if (rt <= n && las != rt) cnt += calc(rt, k - len[rt]);
    }
    printf("%I64d\n", cnt);
  }
  return 0;
}