#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
bool b[1 << 20];
vector<pair<int, int> > query[N];
int ans[N];
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  long long res = 1;
  vector<int> v;
  for (int i = 1; i <= n; i++) {
    int a;
    scanf("%d", &a);
    v.push_back(a);
  }
  for (int i = 1; i <= q; i++) {
    int l, x;
    scanf("%d %d", &l, &x);
    query[l - 1].push_back(make_pair(x, i));
  }
  b[0] = 1;
  vector<int> s;
  s.push_back(0);
  for (int i = 0; i < n; i++) {
    if (b[v[i]]) {
      res <<= 1;
      res %= inf;
    } else {
      int siz = (int)s.size();
      for (int j = 0; j < siz; j++) {
        if (!b[s[j] ^ v[i]]) {
          b[s[j] ^ v[i]] = 1;
          s.push_back(s[j] ^ v[i]);
        }
      }
    }
    for (int j = 0; j < (int)query[i].size(); j++) {
      ans[query[i][j].second] = (b[query[i][j].first] ? res : 0);
    }
  }
  for (int i = 1; i <= q; i++) {
    printf("%d\n", ans[i]);
  }
}
