#include <bits/stdc++.h>
using namespace std;
void A302() {
  int n, m;
  cin >> n >> m;
  int a;
  int pos = 0;
  int neg = 0;
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (a == -1) neg++;
    if (a == 1) pos++;
  }
  if (pos > neg) pos = neg;
  vector<int> l(m);
  vector<int> r(m);
  for (int i = 0; i < m; i++) cin >> l[i] >> r[i];
  for (int i = 0; i < m; i++) {
    if ((r[i] - l[i]) / 2 < pos && (r[i] - l[i]) % 2)
      cout << 1 << "\n";
    else
      cout << 0 << "\n";
  }
}
void B302() {
  int n, m;
  cin >> n >> m;
  vector<int> c(n);
  vector<int> t(n);
  for (int i = 0; i < n; i++) cin >> c[i] >> t[i];
  vector<int> v(m);
  for (int i = 0; i < m; i++) cin >> v[i];
  vector<long> ch(n);
  ch[0] = c[0] * t[0];
  for (int i = 1; i < n; i++) ch[i] = ch[i - 1] + c[i] * t[i];
  int cur = 0;
  for (int i = 0; i < m; i++) {
    for (int j = cur; j < n; j++) {
      if (v[i] <= ch[j]) {
        cur = j;
        cout << cur + 1 << "\n";
        break;
      }
    }
  }
}
int main() { A302(); }

### Prompt

Please create a solution in cpp to the following problem:

Eugeny has array a = a1, a2, ..., an, consisting of n integers. Each integer ai equals to -1, or to 1. Also, he has m queries:

  * Query number i is given as a pair of integers li, ri (1 ≤ li ≤ ri ≤ n). 
  * The response to the query will be integer 1, if the elements of array a can be rearranged so as the sum ali + ali + 1 + ... + ari = 0, otherwise the response to the query will be integer 0. 



Help Eugeny, answer all his queries.

Input

The first line contains integers n and m (1 ≤ n, m ≤ 2·105). The second line contains n integers a1, a2, ..., an (ai = -1, 1). Next m lines contain Eugene's queries. The i-th line contains integers li, ri (1 ≤ li ≤ ri ≤ n).

Output

Print m integers — the responses to Eugene's queries in the order they occur in the input.

Examples

Input

2 3
1 -1
1 1
1 2
2 2


Output

0
1
0


Input

5 5
-1 1 1 1 -1
1 1
2 3
3 5
2 5
1 5


Output

0
1
0
1
0

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void A302() {
  int n, m;
  cin >> n >> m;
  int a;
  int pos = 0;
  int neg = 0;
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (a == -1) neg++;
    if (a == 1) pos++;
  }
  if (pos > neg) pos = neg;
  vector<int> l(m);
  vector<int> r(m);
  for (int i = 0; i < m; i++) cin >> l[i] >> r[i];
  for (int i = 0; i < m; i++) {
    if ((r[i] - l[i]) / 2 < pos && (r[i] - l[i]) % 2)
      cout << 1 << "\n";
    else
      cout << 0 << "\n";
  }
}
void B302() {
  int n, m;
  cin >> n >> m;
  vector<int> c(n);
  vector<int> t(n);
  for (int i = 0; i < n; i++) cin >> c[i] >> t[i];
  vector<int> v(m);
  for (int i = 0; i < m; i++) cin >> v[i];
  vector<long> ch(n);
  ch[0] = c[0] * t[0];
  for (int i = 1; i < n; i++) ch[i] = ch[i - 1] + c[i] * t[i];
  int cur = 0;
  for (int i = 0; i < m; i++) {
    for (int j = cur; j < n; j++) {
      if (v[i] <= ch[j]) {
        cur = j;
        cout << cur + 1 << "\n";
        break;
      }
    }
  }
}
int main() { A302(); }

```