#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int MAX_N = 100010;
const int d = 35;
int n, q;
int arr[MAX_N];
int basisAtT[MAX_N][d];
int basis[d];
long long p2[MAX_N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  p2[0] = 1;
  for (int i = 1; i < MAX_N; i++) p2[i] = (p2[i - 1] * 2LL) % MOD;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i < n; i++) {
    int val = arr[i];
    while (val != 0) {
      int idx = __builtin_clz(val);
      if (basis[idx] != 0) {
        val ^= basis[idx];
      } else {
        ;
        basis[idx] = val;
        break;
      }
    }
    for (int j = 0; j < d; j++) basisAtT[i][j] = basis[j];
  }
  for (int i = 0; i < d; i++)
    ;
  while (q--) {
    int l, x;
    cin >> l >> x;
    l--;
    bool covered = 1;
    int val = x;
    while (val != 0) {
      int idx = __builtin_clz(val);
      if (basisAtT[l][idx] != 0) {
        val ^= basisAtT[l][idx];
      } else {
        covered = 0;
        break;
      }
    }
    if (covered) {
      int bsize = 0;
      for (int i = 0; i < d; i++) bsize += (basisAtT[l][i] != 0);
      int cnt = l + 1 - bsize;
      cout << p2[cnt] << "\n";
    } else {
      cout << "0\n";
    }
  }
}
