Given an array of N elements, indexed from 0 to N-1. Now you are given some queries in the form [L, R] inclusive. Your task is to find the number of occurence of the highest value from L to R.

Let’s say, an array A = {1001, 3, 5, 5, 99}, and L = 2, R = 3. So, here the highest value from index 2 to 3 is 5 and the number of occurence of 5 is exactly 2. So, you have to print 2.

Input begins with an integer T, denoting the number of test cases.

Each case starts with two integers N and Q. The next line contains N space separated integers forming the array A.

The next Q lines will contain the queries which is in the form L to R.

Constrains:
* 1 ≤ T ≤ 20
* 1 ≤ N, Q ≤ 10⁴
* -2x10⁵ < A[i] < 2x10⁵
* 0 ≤ L ≤ R < N

For each test case, print the case number in a single line. Then for each query you have to print the number of occurrence of the maximum number between index L to R.