#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct xxj {
  int a[30], sz, n;
  void it(int x) {
    for (int i = 25; i >= 0; i--)
      if ((x >> i) & 1) {
        if (!a[i]) {
          a[i] = x;
          sz++;
          return;
        }
        x ^= a[i];
        if (!x) return;
      }
  }
  bool in(int x) {
    for (int i = 25; i >= 0; i--)
      if ((x >> i) & 1) {
        if (!a[i]) return 0;
        x ^= a[i];
      }
    return 1;
  }
} lb[100010];
long long qp(int x) {
  long long bs = 2ll, ret = 1ll;
  while (x) {
    if (x & 1) ret = ret * bs % mod;
    bs = bs * bs % mod, x >>= 1;
  }
  return ret;
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  for (int i = 1, s; i <= n; i++) {
    lb[i] = lb[i - 1], lb[i].n = lb[i - 1].n + 1;
    scanf("%d", &s);
    lb[i].it(s);
  }
  while (q--) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (lb[x].in(y))
      printf("%lld\n", qp(x - lb[x].sz));
    else
      puts("0");
  }
}
