#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int power(int x, int p) {
  if (p == 0) return 1;
  if (p % 2) return (x * 1LL * power(x, p - 1)) % MOD;
  int y = power(x, p / 2) % MOD;
  return (y * 1LL * y) % MOD;
}
const int LOG_A = 20;
const int N = 1e5;
int basis[N][LOG_A];
int sz[N];
int totsz;
void insertVector(int mask, int j) {
  for (int i = 0; i < (LOG_A); i++)
    if (j) basis[j][i] = basis[j - 1][i];
  for (int i = 0; i < (LOG_A); i++) {
    if ((mask & 1 << i) == 0) continue;
    if (!basis[j][i]) {
      basis[j][i] = mask;
      totsz++;
      return;
    }
    mask ^= basis[j][i];
  }
}
bool is_representable_using_basis(int mask, int j) {
  for (int i = 0; i < (LOG_A); i++) {
    if ((mask & 1 << i) == 0) continue;
    if (!basis[j][i]) {
      return false;
    }
    mask ^= basis[j][i];
  }
  return true;
}
void solve() {
  int n, q;
  cin >> n >> q;
  int arr[n];
  for (int i = 0; i < (n); i++) cin >> arr[i];
  for (int i = 0; i < (n); i++) {
    insertVector(arr[i], i);
    sz[i] = totsz;
  }
  while (q--) {
    int l, x;
    cin >> l >> x;
    if (is_representable_using_basis(x, l - 1)) {
      cout << power(2, l - sz[l - 1]) << endl;
    } else {
      cout << "0" << endl;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  t = 1;
  while (t--) solve();
}
