#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
int a, s, d, f, g, q, w, e, r, h, j;
int ar[200010];
int arz[400000];
int arx[100000];
int main() {
  cin >> a >> f;
  for (s = 0; s < a; ++s) {
    cin >> ar[s];
  }
  g = h = 0;
  for (s = 0; s < a; ++s) {
    if (ar[s] == -1) {
      ++g;
    } else {
      ++h;
    }
  }
  for (s = 0; s < f; ++s) {
    cin >> q >> w;
    e = w - q + 1;
    if (e % 2 != 0) {
      cout << 0 << endl;
    } else {
      if ((e / 2 <= g) && (e / 2 <= h)) {
        cout << 1 << endl;
      } else {
        cout << 0 << endl;
      }
    }
  }
  return 0;
}

### Prompt

Create a solution in cpp for 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;
#pragma comment(linker, "/STACK:64000000")
int a, s, d, f, g, q, w, e, r, h, j;
int ar[200010];
int arz[400000];
int arx[100000];
int main() {
  cin >> a >> f;
  for (s = 0; s < a; ++s) {
    cin >> ar[s];
  }
  g = h = 0;
  for (s = 0; s < a; ++s) {
    if (ar[s] == -1) {
      ++g;
    } else {
      ++h;
    }
  }
  for (s = 0; s < f; ++s) {
    cin >> q >> w;
    e = w - q + 1;
    if (e % 2 != 0) {
      cout << 0 << endl;
    } else {
      if ((e / 2 <= g) && (e / 2 <= h)) {
        cout << 1 << endl;
      } else {
        cout << 0 << endl;
      }
    }
  }
  return 0;
}

```