#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int mod = 1000000007;
const int maxn = 100100;
long long pow2[maxn], inv2[maxn];
long long arr[maxn];
long long sum[maxn];
int to[maxn][20];
long long tosum[maxn][20];
long long rto[maxn], rtosum[maxn];
int n, nq;
long long getsum(int a, int b) {
  long long ans = sum[b];
  if (a) {
    ans -= sum[a - 1];
    ans = (ans % mod + mod) % mod;
  }
  return inv2[a] * ans % mod;
}
int main() {
  ios_base::sync_with_stdio(0);
  pow2[0] = inv2[0] = 1;
  pow2[1] = 2;
  inv2[1] = pow(2, mod - 2, mod);
  for (int i = 1; i < maxn; i++) {
    pow2[i] = pow2[i - 1] * 2 % mod;
    inv2[i] = inv2[i - 1] * inv2[1] % mod;
  }
  scanf("%d%d", &n, &nq);
  for (int i = 0; i < n; i++) {
    scanf("%I64d", arr + i);
    sum[i] = arr[i] * pow2[i];
    if (i) sum[i] += sum[i - 1];
    sum[i] = (sum[i] % mod + mod) % mod;
  }
  rto[0] = -1;
  rtosum[0] = arr[0];
  for (int i = 1; i < n; i++) {
    rto[i] = i - 1;
    long long rsum = arr[i];
    while (rto[i] != -1 && rsum >= 0) {
      int nextto = rto[rto[i]];
      if ((rto[i] - nextto > 30 && rsum != 0) || nextto == -1) {
        rto[i] = -1;
        rsum = getsum(0, i);
        break;
      }
      rsum = rsum * pow(2, rto[i] - nextto, 0);
      rsum += rtosum[rto[i]];
      if (rsum >= 1000000000ll) {
        rto[i] = -1;
        rsum = getsum(0, i);
        break;
      }
      rto[i] = nextto;
    }
    rtosum[i] = rsum;
  }
  for (int i = 0; i < n; i++) {
    to[i][0] = rto[i];
    tosum[i][0] = rtosum[i];
    if (rto[i] != -1) {
      tosum[i][0] = tosum[i][0] * 2 % mod;
    }
    tosum[i][0] = (tosum[i][0] % mod + mod) % mod;
  }
  for (int j = 1; j < 20; j++) {
    for (int i = 0; i < n; i++) {
      if (to[i][j - 1] == -1) {
        to[i][j] = -1;
        tosum[i][j] = tosum[i][j - 1];
        continue;
      }
      to[i][j] = to[to[i][j - 1]][j - 1];
      tosum[i][j] = tosum[i][j - 1] + tosum[to[i][j - 1]][j - 1];
      tosum[i][j] %= mod;
    }
  }
  for (int i = 0; i < nq; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    long long ans = 0, st = b;
    for (int j = 19; j >= 0; j--) {
      if (to[st][j] >= a) {
        ans += tosum[st][j];
        ans %= mod;
        st = to[st][j];
      }
    }
    if (st >= a) {
      ans += getsum(a, st);
      ans %= mod;
    }
    printf("%I64d\n", (ans % mod + mod) % mod);
  }
  return 0;
}
