Just Even/Odd

0

0 votes
Easy
Problem

Too lazy for a story, let's jump into the question directly.

Given an array A of size N, and Q queries. In each query you are given two integers L and RFor each query find the product of number of even elements and number of odd elements from A[L] to A[R] (Both inclusive). 

NOTE: This Question contains heavy I/O. 

Input Format:

First line contains T, the number of test cases.

First line of each test case contains two integers N and Qthe size of the array and the number of queries respectively.

Second line of each testcase contains N space separated integers (the array A).

Next Q lines of each testcase contains two integers L and R (0 - based), the start and end index respectively.

Output Format:

For each query (in all the testcases) print the required result.

Constraints:

1 <= T <= 10

1 <= N,Q <= 100000

0 <= L,R < N

0 <= A[i] <= 1000

Sample Input
2
5 5
2 3 4 5 6
0 2
2 4
1 4
1 3
0 4
3 3
2 2 1
0 0
0 1
0 2
Sample Output
2
2
4
2
6
0
0
2
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation

In the first test case,

Query 1:  L = 0 R = 2

No of even = 2 (2,4)

No of odd = 1 (3)

Output = 2*1 = 2 

Editor Image

?