#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int m, n, l, r, neg = 0, pos = 0;
  cin >> n >> m;
  int A[n], c = 0, i;
  for (i = 0; i < n; i++) {
    cin >> A[i];
    if (A[i] == -1)
      neg++;
    else
      pos++;
  }
  while (c < m) {
    scanf("%I64d%I64d", &l, &r);
    if ((r - l) % 2 == 0) {
      cout << "0" << endl;
      c++;
      continue;
    } else {
      int k = r - l + 1;
      if (neg >= k / 2 && pos >= k / 2) {
        cout << "1" << endl;
      } else {
        cout << "0" << endl;
      }
      c++;
    }
  }
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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;
int main() {
  long long int m, n, l, r, neg = 0, pos = 0;
  cin >> n >> m;
  int A[n], c = 0, i;
  for (i = 0; i < n; i++) {
    cin >> A[i];
    if (A[i] == -1)
      neg++;
    else
      pos++;
  }
  while (c < m) {
    scanf("%I64d%I64d", &l, &r);
    if ((r - l) % 2 == 0) {
      cout << "0" << endl;
      c++;
      continue;
    } else {
      int k = r - l + 1;
      if (neg >= k / 2 && pos >= k / 2) {
        cout << "1" << endl;
      } else {
        cout << "0" << endl;
      }
      c++;
    }
  }
  return 0;
}

```