跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2453. Eugeny and Array

  • ID: 2459
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 模拟
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Eugeny and Array

题目描述

A. Eugeny and Array
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2086 题。保留原作者与原赛事署名。