#include <bits/stdc++.h>
using namespace std;
const int N = 100005, P = 1000000007;
int n, q, cnt, c[25], a[N], pw[N], ans[N];
void ins(int num) {
  for (int i = 19; i >= 0; --i)
    if (num & (1 << i)) {
      if (!c[i]) {
        c[i] = num;
        ++cnt;
        return;
      } else
        num ^= c[i];
    }
}
bool check(int num) {
  for (int i = 19; i >= 0; --i)
    if (num & (1 << i)) num ^= c[i];
  return !num;
}
struct Query {
  int l, x, id;
} qq[N];
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> q;
  pw[0] = 1;
  for (int i = 1; i <= n; i++) cin >> a[i], pw[i] = pw[i - 1] * 2 % P;
  for (int i = 1; i <= q; i++) cin >> qq[i].l >> qq[i].x, qq[i].id = i;
  sort(qq + 1, qq + q + 1, [](Query a, Query b) { return a.l < b.l; });
  int ptr = 1;
  for (int i = 1; i <= q; i++) {
    while (ptr <= qq[i].l) ins(a[ptr++]);
    if (check(qq[i].x)) ans[qq[i].id] = pw[ptr - 1 - cnt];
  }
  for (int i = 1; i <= q; i++) cout << ans[i] << endl;
  return 0;
}
