#include <bits/stdc++.h>
using namespace std;
struct Query {
  int i, l, x;
  long long ans;
  Query(int i = 0, int l = 0, int x = 0) : i(i), l(l), x(x) { ans = 0; }
};
class Basis {
  int b[20], cnt;

 public:
  Basis() {
    for (int i = 0; i < 20; i++) b[i] = 0;
    cnt = 0;
  }
  void insert(int x) {
    for (int i = 19; i >= 0; i--) {
      if (x & (1 << i)) {
        if (!b[i]) {
          b[i] = x;
          cnt++;
          return;
        } else
          x ^= b[i];
      }
    }
  }
  bool in_span(int x) {
    for (int i = 19; i >= 0; i--) {
      if (x & (1 << i)) {
        if (b[i])
          x ^= b[i];
        else
          return false;
      }
    }
    return true;
  }
  size_t size() { return cnt; }
};
const int MAXN = 1e5 + 20;
const long long P = 1e9 + 7;
int n, qn, a[MAXN];
Query q[MAXN];
long long pow(long long base, long long exp) {
  long long ans = 1, mul = base;
  while (exp) {
    if (exp % 2) ans = ans * mul % P;
    mul = mul * mul % P;
    exp /= 2;
  }
  return ans;
}
int main() {
  scanf("%d%d", &n, &qn);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < qn; i++) {
    scanf("%d%d", &q[i].l, &q[i].x);
    q[i].i = i;
  }
  sort(q, q + qn, [](const Query& a, const Query& b) { return a.l < b.l; });
  Basis b;
  int cur = 1;
  for (int i = 0; i < qn; i++) {
    while (cur <= q[i].l) b.insert(a[cur++]);
    if (b.in_span(q[i].x))
      q[i].ans = pow(2, cur - 1 - b.size());
    else
      q[i].ans = 0;
  }
  sort(q, q + qn, [](const Query& a, const Query& b) { return a.i < b.i; });
  for (int i = 0; i < qn; i++) printf("%lld\n", q[i].ans);
}
