#include <bits/stdc++.h>
using namespace std;
struct node {
  long long l;
  long long x;
  long long num;
  bool operator<(const node n1) const { return l < n1.l; }
} node[200005];
long long p[70];
long long ans;
long long qsm(long long x, long long y) {
  long long a = 1;
  long long base = x;
  while (y > 0) {
    if (y & 1) {
      a = (a * base) % 1000000007;
    }
    base = (base * base) % 1000000007;
    y >>= 1;
  }
  return a;
}
void xxj(long long x) {
  for (int i = 62; i >= 0; i--) {
    if (x & (1ll * 1 << i)) {
      if (!p[i]) {
        p[i] = x;
        break;
      } else {
        x ^= p[i];
      }
    }
  }
  if (x == 0) ans++;
  return;
}
long long query(long long x) {
  for (int i = 62; i >= 0; i--) {
    if (x & (1ll * 1 << i)) {
      x ^= p[i];
    }
  }
  if (x == 0) {
    return qsm(2, ans);
  } else {
    return 0;
  }
}
long long n, q;
long long a[200005];
long long res[200005];
int main() {
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= q; i++) {
    cin >> node[i].l >> node[i].x;
    node[i].num = i;
  }
  sort(node + 1, node + q + 1);
  long long now = 0;
  for (int i = 1; i <= q; i++) {
    while (now < node[i].l) {
      now++;
      xxj(a[now]);
    }
    res[node[i].num] = query(node[i].x);
  }
  for (int i = 1; i <= q; i++) {
    cout << res[i] << endl;
  }
}
