#include <bits/stdc++.h>
const int mod = 1000000007;
const int inf = 1000000009;
const long long INF = 1000000000000000009;
const long long big = 1000000000000000;
const long double eps = 0.0000000001;
using namespace std;
int B[100005][21];
int S[100005];
int main() {
  ios::sync_with_stdio(false);
  cin.tie();
  cout.tie();
  int n, q;
  cin >> n >> q;
  S[0] = 1;
  for (int i = 1; i <= n; i++) {
    int a;
    cin >> a;
    for (int j = 19; j >= 0; j--) B[i][j] = B[i - 1][j];
    bool czy = false;
    for (int j = 19; j >= 0; j--)
      if (a & (1 << j)) {
        if (!B[i][j]) {
          czy = true;
          B[i][j] = a;
          break;
        }
        a ^= B[i][j];
      }
    S[i] = S[i - 1];
    if (!czy) {
      S[i] *= 2;
      S[i] %= mod;
    }
  }
  for (int i = 1; i <= q; i++) {
    int l, a;
    cin >> l >> a;
    bool czy = false;
    for (int j = 19; j >= 0; j--) {
      if (a & (1 << j)) {
        if (!B[l][j]) {
          czy = true;
          break;
        }
        a ^= B[l][j];
      }
    }
    if (!czy)
      cout << S[l] << "\n";
    else
      cout << "0\n";
  }
  return 0;
}
