#include <bits/stdc++.h>
using namespace std;
long long inf = 1000000007;
template <class T>
T bigmod(T b, T p, T m) {
  if (p == 1) return b;
  T res = bigmod(b, p / 2, m);
  res = (res * res) % m;
  if (p % 2 == 1) res = (res * b) % m;
  return res;
}
template <class T>
T gcd(T x, T y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
template <typename T>
T POW(T b, T p) {
  if (p == 1) return b;
  if (p % 2 == 0) {
    T s = POW(b, p / 2);
    return s * s;
  }
  return b * POW(b, p - 1);
}
template <typename T>
T modinv(T num, T m) {
  return bigmod(num, m - 2, m);
}
int main() {
  long long n, m;
  cin >> n >> m;
  long long a, o, e, x, y;
  o = e = 0;
  while (n--) {
    cin >> a;
    if (a == -1)
      o++;
    else
      e++;
  }
  while (m--) {
    cin >> x >> y;
    long long f = y - x + 1;
    if (f & 1)
      cout << 0 << endl;
    else {
      long long g = f / 2;
      if (g <= o && g <= e)
        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;
long long inf = 1000000007;
template <class T>
T bigmod(T b, T p, T m) {
  if (p == 1) return b;
  T res = bigmod(b, p / 2, m);
  res = (res * res) % m;
  if (p % 2 == 1) res = (res * b) % m;
  return res;
}
template <class T>
T gcd(T x, T y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
template <typename T>
T POW(T b, T p) {
  if (p == 1) return b;
  if (p % 2 == 0) {
    T s = POW(b, p / 2);
    return s * s;
  }
  return b * POW(b, p - 1);
}
template <typename T>
T modinv(T num, T m) {
  return bigmod(num, m - 2, m);
}
int main() {
  long long n, m;
  cin >> n >> m;
  long long a, o, e, x, y;
  o = e = 0;
  while (n--) {
    cin >> a;
    if (a == -1)
      o++;
    else
      e++;
  }
  while (m--) {
    cin >> x >> y;
    long long f = y - x + 1;
    if (f & 1)
      cout << 0 << endl;
    else {
      long long g = f / 2;
      if (g <= o && g <= e)
        cout << 1 << endl;
      else
        cout << 0 << endl;
    }
  }
  return 0;
}

```