Ehab has an array a of n integers. He likes the [bitwise-xor operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) and he likes to bother Mahmoud so he came up with a problem. He gave Mahmoud q queries. In each of them, he gave Mahmoud 2 integers l and x, and asked him to find the number of subsequences of the first l elements of the array such that their bitwise-xor sum is x. Can you help Mahmoud answer the queries?

A subsequence can contain elements that are not neighboring.

Input

The first line contains integers n and q (1 ≤ n, q ≤ 105), the number of elements in the array and the number of queries.

The next line contains n integers a1, a2, ..., an (0 ≤ ai < 220), the elements of the array.

The next q lines, each contains integers l and x (1 ≤ l ≤ n, 0 ≤ x < 220), representing the queries.

Output

For each query, output its answer modulo 109 + 7 in a newline.

Examples

Input

5 5
0 1 2 3 4
4 3
2 0
3 7
5 7
5 8


Output

4
2
0
4
0


Input

3 2
1 1 1
3 1
2 0


Output

4
2

Note

The bitwise-xor sum of the empty set is 0 and the bitwise-xor sum of a set containing one element is that element itself.
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 10;
const int MOD = 1e9 + 7;
inline int add(int a, int b) { return (a + b) % MOD; }
inline int sub(int a, int b) { return (a - b + MOD) % MOD; }
inline int mult(long long int a, long long int b) { return (a * b) % MOD; }
inline int bin_pow(int n, int k) {
  int ans = 1;
  while (k) {
    if (k % 2 == 0) {
      k /= 2;
      n = mult(n, n);
    } else {
      k--;
      ans = mult(ans, n);
    }
  }
  return ans;
}
inline int inv(int n) { return bin_pow(n, MOD - 2); }
struct query {
  int idx, l, x;
  query(int idx, int l, int x) : idx(idx), l(l), x(x) {}
  bool operator<(const query& o) const { return l < o.l; }
};
void solve() {
  int n, q;
  cin >> n >> q;
  vector<int> a(n);
  for (int& x : a) cin >> x;
  vector<query> qs;
  vector<int> ans(q);
  for (int i = 0; i < q; ++i) {
    int l, x;
    cin >> l >> x;
    --l;
    qs.emplace_back(i, l, x);
  }
  sort(qs.begin(), qs.end());
  int ptr = 0;
  vector<int> vecs;
  int zeros = 0;
  for (int i = 0; i < n; ++i) {
    int x = a[i];
    for (int& vec : vecs) {
      int o_piv = __builtin_clz(vec);
      int piv = __builtin_clz(x);
      if (o_piv == piv && __builtin_popcount(x)) x ^= vec;
    }
    if (x) {
      vecs.push_back(x);
      sort(vecs.begin(), vecs.end());
      reverse(vecs.begin(), vecs.end());
    } else {
      ++zeros;
    }
    while (ptr < q && qs[ptr].l == i) {
      int idx, l, x;
      idx = qs[ptr].idx, l = qs[ptr].l, x = qs[ptr].x;
      for (int& vec : vecs) {
        int o_piv = __builtin_clz(vec);
        int piv = __builtin_clz(x);
        if (o_piv == piv && __builtin_popcount(x)) x ^= vec;
      }
      if (x == 0) {
        ans[idx] = bin_pow(2, zeros);
      }
      ++ptr;
    }
  }
  for (int x : ans) {
    cout << x << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(20);
  cout << fixed;
  solve();
  cout.flush();
  return 0;
}
