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;
template <typename T>
using maxHeap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
using minHeap = priority_queue<T, vector<T>, greater<T>>;
template <typename Iter>
ostream& _out(ostream& s, Iter b, Iter e) {
  s << "[";
  for (auto it = b; it != e; it++) s << (it == b ? "" : " ") << *it;
  s << "]";
  return s;
}
template <typename A, typename B>
ostream& operator<<(ostream& s, const pair<A, B>& p) {
  return s << "(" << p.first << "," << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& s, const vector<T>& c) {
  return _out(s, begin(c), end(c));
}
bool debug = 0;
template <typename T>
void DEBUG(const T& x) {
  if (debug) cerr << x;
}
template <typename T, typename... Args>
void DEBUG(const T& head, const Args&... tail) {
  if (debug) {
    cerr << head;
    DEBUG(tail...);
  }
}
const int N = 100000 + 5;
const int LOG_C = 20;
const int MOD = 1000000007;
struct LinearBasis {
 private:
  int n, sz;
  vector<int> b;
  inline int two(int x) { return 1 << x; }

 public:
  void init(int n_) {
    n = n_;
    b.clear();
    b.resize(n);
    sz = 0;
  }
  void add(int x) {
    for (int i = n - 1; i >= 0; i--)
      if (two(i) & x) {
        if (b[i])
          x ^= b[i];
        else {
          b[i] = x;
          for (int j = i - 1; j >= 0; j--)
            if (b[j] and two(j) & b[i]) {
              b[i] ^= b[j];
            }
          for (int j = i + 1; j < n; j++)
            if (two(i) & b[j]) {
              b[j] ^= b[i];
            }
          sz++;
          break;
        }
      }
  }
  inline int size() { return sz; }
  bool check(int x) {
    for (int i = n - 1; i >= 0; i--)
      if (two(i) & x) {
        if (b[i])
          x ^= b[i];
        else
          return false;
      }
    return true;
  }
} base;
inline int add(int a, int b) { return a + b >= MOD ? a + b - MOD : a + b; }
inline int mul(int a, int b) { return 1LL * a * b % MOD; }
int arr[N], ans[N];
vector<pair<int, int>> que[N];
int main(int argc, char* argv[]) {
  if (argc > 1 and string(argv[1]) == "-D") debug = 1;
  if (!debug) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
  }
  base.init(LOG_C);
  int n, q;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  for (int i = 0; i < q; i++) {
    int p, x;
    cin >> p >> x;
    que[p].push_back({x, i});
  }
  int cur = 1;
  for (int i = 1; i <= n; i++) {
    bool ex = base.check(arr[i]);
    if (debug)
      cerr << __PRETTY_FUNCTION__ << ":" << 127 << " - " << ("ex") << "="
           << (ex) << '\n';
    if (ex)
      cur = mul(cur, 2);
    else
      base.add(arr[i]);
    for (auto qq : que[i]) ans[qq.second] = base.check(qq.first) * cur;
  }
  for (int i = 0; i < q; i++) cout << ans[i] << '\n';
  return 0;
}
