#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100005;
vector<pair<int, int> > que[MAX_N];
int basis[20];
int cnt;
int t[MAX_N];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  t[0] = 1;
  for (int i = 0; i < (int)(n); ++i) {
    cin >> a[i];
    t[i + 1] = t[i] * 2 % 1000000007;
  }
  for (int i = 0; i < (int)(20); ++i) {
    basis[i] = -1;
  }
  vector<int> ans(q);
  for (int i = 0; i < (int)(q); ++i) {
    int a, b;
    cin >> a >> b;
    que[a - 1].push_back((pair<int, int>(b, i)));
  }
  for (int i = 0; i < (int)(n); ++i) {
    for (int j = (int)(20) - 1; j >= 0; --j) {
      if ((a[i] >> j) & 1) {
        if (basis[j] < 0) {
          basis[j] = a[i];
          cnt++;
          break;
        } else {
          a[i] ^= basis[j];
        }
      }
    }
    for (auto&(it) : (que[i])) {
      bool ok = true;
      for (int j = (int)(20) - 1; j >= 0; --j) {
        if ((it.first >> j) & 1) {
          if (basis[j] < 0) {
            ok = false;
            ans[it.second] = 0;
            break;
          } else {
            it.first ^= basis[j];
          }
        }
      }
      if (ok) ans[it.second] = t[i + 1 - cnt];
    }
  }
  for (int i = 0; i < (int)(q); ++i) {
    cout << ans[i] << "\n";
  }
  return 0;
}
