#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
inline int msb(int n) {
  int b = 1;
  while (b < 32) {
    n |= n >> b;
    b <<= 1;
  }
  return (n + 1) >> 1;
}
int A[N];
int res[N];
vector<int> bas[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> A[i];
  }
  vector<int> cur_bas;
  int ans = 1;
  for (int i = 1; i <= n; i++) {
    cur_bas.push_back(A[i]);
    int sz = cur_bas.size();
    for (int i = 0; i < sz - 1; i++) {
      int ms = msb(cur_bas[i]);
      if (cur_bas.back() & ms) cur_bas.back() ^= cur_bas[i];
    }
    if (cur_bas.back() == 0) {
      cur_bas.pop_back();
      ans += ans;
      if (ans >= MOD) ans -= MOD;
    }
    bas[i] = cur_bas;
    res[i] = ans;
  }
  while (q--) {
    int l, x;
    cin >> l >> x;
    cur_bas = bas[l];
    cur_bas.push_back(x);
    int sz = cur_bas.size();
    for (int i = 0; i < sz - 1; i++) {
      int ms = msb(cur_bas[i]);
      if (cur_bas.back() & ms) cur_bas.back() ^= cur_bas[i];
    }
    if (cur_bas.back() == 0) {
      cout << res[l] << "\n";
    } else {
      cout << 0 << "\n";
    }
  }
  return 0;
}
