#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
const int BASE = 1e9 + 7;
int n, q;
bool a[MAX];
int f[MAX];
int num[MAX][2];
int Power(int x, int y) {
  if (y == 0) return 1;
  int tmp = Power(x, y / 2);
  if (y % 2) return (1LL * ((1LL * tmp * tmp) % BASE) * x) % BASE;
  return (1LL * tmp * tmp) % BASE;
}
void Preprocess() {
  f[0] = 1;
  for (int i = 1; i <= n; ++i) f[i] = (1LL * f[i - 1] + Power(2, i)) % BASE;
  for (int i = 1; i <= n; ++i) {
    num[i][0] = num[i - 1][0];
    num[i][1] = num[i - 1][1];
    if (a[i])
      ++num[i][1];
    else
      ++num[i][0];
  }
}
int Calc(int l, int r) {
  int x = num[r][0] - num[l - 1][0];
  int y = num[r][1] - num[l - 1][1];
  int M = f[y - 1];
  return (1LL * M * (1 + f[x - 1])) % BASE;
}
int main() {
  cin >> n >> q;
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); ++i)
    if (s[i] == '0')
      a[i + 1] = 0;
    else
      a[i + 1] = 1;
  Preprocess();
  for (int i = 1; i <= q; ++i) {
    int l, r;
    cin >> l >> r;
    cout << Calc(l, r) << endl;
  }
  return 0;
}
