시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 128 MB 1 1 1 100.000%

문제

Georg's new MP3 player has many interesting features, one of them being the key lock. All the keys are locked after more than T seconds of inactivity. After the key lock is engaged, no key performs its original function, but if any key is pressed, the key lock is disengaged.

For example, assume that T = 5 and the player is currently locked. Georg presses the key A, waits for 3 seconds, presses the key B, waits for 5 seconds, presses C, waits for 6 seconds, and presses D. In this case only the keys B and C perform their regular functions. Note that the keys became locked between C and D was pressed.

Sound level of the MP3 player is controlled by the + and - keys, increasing and decreasing volume by 1 unit respectively. The sound level is an integer between 0 and Vmax. Pressing the + key at volume Vmax or pressing the - key at volume 0 leaves the volume unchanged.

Georg does not know the value of T. He wanted to find it by an experiment. Starting with a locked keyboard, he pressed a sequence of N + and - keys. At the end of the experiment Georg read the final volume from the player's display. Unfortunately, he forgot to note the volume before his first keypress. For the purpose of this task, the unknown initial volume will be denoted V1 and the known final volume will be denoted V2.

You are given the value V2 and a list of keystrokes in the order in which Georg made them. For each key, you are given the type of the key (+ or -) and the number of seconds from the beginning of the experiment to the moment when the key was pressed. The task is to find the largest possible integer value of T which is consistent with the outcome of the experiment.

입력

The first line of the input contains three space-separated integers N, Vmax and V2 (0 ≤ V2 ≤ Vmax). Each of the next N lines contains a description of one key in the sequence: a character + or -, a space and an integer Ci (0 ≤ Ci ≤ 2·109), the number of seconds from the beginning of the experiment. You may assume that the keypresses are in sorted order and that all times are distinct (i.e., Ci < Ci + 1 for all 1 ≤ i < N).

출력

If T can be arbitrarily large, output a single line containing the word "infinity" (quotes for clarity).

Otherwise, output a single line containing two integers T and V1 separated by a single space.

The values must be such that carrying out the experiment with locking time T starting at volume V1 gives the final volume V2. If there are multiple possible answers, output the one with the largest T; if there are still multiple possible answers, output the one with the largest V1.

(Note that at least one solution always exists: for T = 0 none of the keys performs its action, so it suffices to take V1 = V2.)

제한

You may assume that 2 ≤ N ≤ 100 000 and 2 ≤ Vmax ≤ 5 000.

예제 입력 1

6 4 3
- 0
+ 8
+ 9
+ 13
- 19
- 24

예제 출력 1

5 4

For T = 5 the keys perform the following actions: unlock, unlock, +, +, unlock, -.

For any V1 ∈ {2, 3, 4} we would get V2 = 3. Note that the output contains the largest possible V1.

For T ≥ 6 the last two keystrokes will both be active, hence it will be impossible to have V2 = 3.

예제 입력 2

3 10 10
+ 1
+ 2
+ 47

예제 출력 2

infinity

If V1 = 10 then for any T we'll have V2 = 10.