1418. Bound Found

单点时限: 2.0 sec

内存限制: 256 MB

Signals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going through a defiant phase: “But I want to use feet, not meters!”). Each signal seems to come in two parts: a sequence of n integer values and a non-negative integer t. We’ll not go into details, but researchers found out that a signal encodes two integer values. These can be found as the lower and upper bound of a subrange of the sequence whose absolute value of its sum is closest to .

You are given the sequence of integers and the non-negative target . You are to find a non-empty range of the sequence (i.e. a continuous subsequence) and output its lower index and its upper index . The absolute value of the sum of the values of the sequence from the -th to the -th element (inclusive) must be at least as close to as the absolute value of the sum of any other non-empty range.

输入格式

The input file contains several test cases.

Each test case starts with two numbers and . Input is terminated by . Otherwise, and there follow integers with absolute values no greater than which constitute the sequence. Then follow queries for this sequence. Each query is a target with .

输出格式

For each query output numbers on a line: some closest absolute sum and the lower and upper indices of some range where this absolute sum is achieved. Possible indices start with and go up to .

样例

Input
5 1
-10 -5 0 5 10
3
10 2
-9 8 -7 6 -5 4 -3 2 -1 0
5 11
15 2
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
15 100
0 0
Output
5 4 4
5 2 8
9 1 1
15 1 15
15 1 15

4 人解决,4 人已尝试。

5 份提交通过,共有 7 份提交。

6.5 EMB 奖励。

创建: 12 年,4 月前.

修改: 2 年,2 月前.

最后提交: 8 月前.

来源: Ulm Local 2001

题目标签