#include <bits/stdc++.h>
using namespace std;
void toSolve() {
  int N = 200000;
  int n, q;
  int a, b;
  cin >> n >> q;
  int arr[n + 4];
  int finalans[q + 2];
  for (int i = 0; i < n; i++) cin >> arr[i + 1];
  vector<vector<pair<int, int>>> queries(N);
  for (int i = 0; i < q; i++) {
    cin >> a >> b;
    queries[a].push_back({b, i});
  }
  set<int> s;
  s.insert(0);
  long long ans = 1;
  for (int i = 1; i <= n; i++) {
    if (s.find(arr[i]) != s.end()) {
      ans = (ans * 2) % 1000000007;
    } else {
      vector<int> v;
      for (auto x : s) {
        v.push_back(x ^ arr[i]);
      }
      for (auto k : v) {
        s.insert(k);
      }
    }
    for (auto it : queries[i]) {
      if (s.find(it.first) != s.end()) {
        finalans[it.second] = ans;
      } else {
        finalans[it.second] = 0;
      }
    }
  }
  for (int i = 0; i < q; i++) cout << finalans[i] << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  toSolve();
  return 0;
}
