2458. Frequent values

单测试点时限: 2.0 秒

内存限制: 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.

样例

Input
10 3
-1 -1 1 1 1 1 3 10 10 10
2 3
1 10
5 10
0
Output
1
4
3

100 人解决,126 已尝试。

168 份提交通过,共有 464 份提交。

7.0 EMB 奖励。

创建: 10 年前.

修改: 1 年,4 月前.

最后提交: 3 周,2 天前.

来源: Ulm Local 2007