Given an array of elements, indexed from 0 to . Now you are given some queries in the form inclusive. Your task is to find the number of occurrence of the highest value from to .
Let's say, an array , and , . So, here the highest value from index 2 to 3 is 5 and the number of occurrence of 5 is exactly 2. So, you have to print 2.
Input begins with an integer (), denoting the number of test cases.
Each case starts with two integers and (). The next line contains N space separated integers forming the array ().
The next Q lines will contain the queries which is in the form to ().
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 to .
1 5 3 1001 3 5 5 99 1 2 2 3 0 4
Case 1: 1 2 1