Problem: JATC loves Banh-mi (a Vietnamese food). His affection for Banh-mi is so much that he always has it for breakfast. This morning, as usual, he buys a Banh-mi and decides to enjoy it in a special way.

First, he splits the Banh-mi into n parts, places them on a row and numbers them from 1 through n. For each part i, he defines the deliciousness of the part as x_i ∈ \{0, 1\}. JATC's going to eat those parts one by one. At each step, he chooses arbitrary remaining part and eats it. Suppose that part is the i-th part then his enjoyment of the Banh-mi will increase by x_i and the deliciousness of all the remaining parts will also increase by x_i. The initial enjoyment of JATC is equal to 0.

For example, suppose the deliciousness of 3 parts are [0, 1, 0]. If JATC eats the second part then his enjoyment will become 1 and the deliciousness of remaining parts will become [1, \\_, 1]. Next, if he eats the first part then his enjoyment will become 2 and the remaining parts will become [\\_, \\_, 2]. After eating the last part, JATC's enjoyment will become 4.

However, JATC doesn't want to eat all the parts but to save some for later. He gives you q queries, each of them consisting of two integers l_i and r_i. For each query, you have to let him know what is the maximum enjoyment he can get if he eats all the parts with indices in the range [l_i, r_i] in some order.

All the queries are independent of each other. Since the answer to the query could be very large, print it modulo 10^9+7.

Input

The first line contains two integers n and q (1 ≤ n, q ≤ 100 000).

The second line contains a string of n characters, each character is either '0' or '1'. The i-th character defines the deliciousness of the i-th part.

Each of the following q lines contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n) — the segment of the corresponding query.

Output

Print q lines, where i-th of them contains a single integer — the answer to the i-th query modulo 10^9 + 7.

Examples

Input

4 2
1011
1 4
3 4


Output

14
3


Input

3 2
111
1 2
3 3


Output

3
1

Note

In the first example: 

  * For query 1: One of the best ways for JATC to eats those parts is in this order: 1, 4, 3, 2. 
  * For query 2: Both 3, 4 and 4, 3 ordering give the same answer. 



In the second example, any order of eating parts leads to the same answer.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, q, i, l, r, MOD = 1e9 + 7, t[100005 * 4], sum[100005];
int solve(int k, int len) { return (sum[len] - sum[len - k] + MOD) % MOD; }
void build(int l, int r, int node) {
  if (l == r) {
    t[node] = getchar() - 48;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, node << 1), build(mid + 1, r, node << 1 | 1);
  t[node] = t[node << 1] + t[node << 1 | 1];
}
int ask(int l, int r, int a, int b, int node) {
  if (l == a && r == b) return t[node];
  int mid = (l + r) >> 1;
  if (b <= mid) return ask(l, mid, a, b, node << 1);
  if (a > mid) return ask(mid + 1, r, a, b, node << 1 | 1);
  return ask(l, mid, a, mid, node << 1) +
         ask(mid + 1, r, mid + 1, b, node << 1 | 1);
}
int main() {
  scanf("%d%d\n", &n, &q);
  build(1, n, 1);
  for (i = 1, sum[0] = 1; i <= n; i++) sum[i] = sum[i - 1] * 2 % MOD;
  for (i = 1; i <= q; i++) {
    scanf("%d%d", &l, &r);
    printf("%d\n", solve(ask(1, n, l, r, 1), r - l + 1));
  }
  return 0;
}