#include <bits/stdc++.h>
using namespace std;
const int MAX = 112345;
const int MAX_BASE = 20;
const int MOD = 1e9 + 7;
int data[MAX];
int bases[MAX][MAX_BASE + 1];
void cal(int a, int b[]) {
  for (int j = MAX_BASE; j >= 0; j--) {
    if (a >> j & 1) {
      if (b[j])
        a ^= b[j];
      else {
        b[j] = a;
        for (int k = j - 1; k >= 0; k--)
          if (b[k] && b[j] >> k & 1) b[j] ^= b[k];
        for (int k = j + 1; k <= MAX_BASE; k++)
          if (b[k] >> j & 1) b[k] ^= b[j];
        break;
      }
    }
  }
}
long long pow_num[MAX];
int check(int a, int b[], int l) {
  int rst = 0;
  int tot = 0;
  for (int i = MAX_BASE; i >= 0; i--) {
    if (a >> i & 1) rst ^= b[i];
    if (b[i]) tot++;
  }
  if (rst != a) return 0;
  return pow_num[l - tot];
}
int main() {
  pow_num[0] = 1;
  for (int i = 1; i < MAX; i++) pow_num[i] = pow_num[i - 1] * 2 % MOD;
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> data[i];
  for (int i = 1; i <= n; i++) {
    memcpy(bases[i], bases[i - 1], sizeof(bases[i]));
    cal(data[i], bases[i]);
  }
  while (q--) {
    int l, x;
    cin >> l >> x;
    cout << check(x, bases[l], l) << endl;
  }
}
