#include <bits/stdc++.h>
using namespace std;
bool chk[(1 << 20) + 5];
int a[(int)(1e5 + 5)], prn[(int)(1e5 + 5)];
pair<int, pair<int, int> > qr[(int)(1e5 + 5)];
vector<int> v;
int main() {
  int n, q, i, j, k, ans, l, s;
  scanf("%d %d", &n, &q);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (i = 0; i < q; i++) {
    scanf("%d %d", &qr[i].first, &qr[i].second.first);
    qr[i].second.second = i;
  }
  sort(qr, qr + q);
  ans = 1;
  chk[0] = 1;
  l = 1;
  v.push_back(0);
  for (i = 0; i < q; i++) {
    j = qr[i].first;
    while (l <= j) {
      if (!chk[a[l]]) {
        s = (int)v.size();
        for (k = 0; k < s; k++) {
          v.push_back(v[k] ^ a[l]);
          chk[v[k] ^ a[l]] = 1;
        }
      } else
        ans = (ans + ans) % (int)(1e9 + 7);
      l++;
    }
    if (chk[qr[i].second.first])
      prn[qr[i].second.second] = ans;
    else
      prn[qr[i].second.second] = 0;
  }
  for (i = 0; i < q; i++) printf("%d\n", prn[i]);
  return 0;
}
