100 人解决，127 人已尝试。
168 份提交通过，共有 468 份提交。
3.3 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
You are given a sequence of integers in non-decreasing order. In addition to that, you are given several queries consisting of indices and . For each query, determine the most frequent value among the integers .
The input consists of several test cases. Each test case starts with a line containing two integers and . The next line contains integers separated by spaces. You can assume that for each : . The following lines contain one query each, consisting of two integers and , which indicate the boundary indices for the query.
The last test case is followed by a line containing a single .
For each query, print one line with one integer: The number of occurrences of the most frequent value within the given range.
10 3 -1 -1 1 1 1 1 3 10 10 10 2 3 1 10 5 10 0
1 4 3