Sum of three values
Given
n integers and a target value T, you are asked if there are 3 values that sum up to the target value T.Input
The input contains two integers
n (2 ≤ n ≤ 1000) and T (1 ≤ T ≤ ).The next line contains
n space-separated integers.Output
The program should print the positions of those 3 values (indexing starts from 0) and
Impossible in case it’s not possible to find such 3 values. In case of several solutions, the program may print any of those.Examples
Input | Output |
5 2
4 1 0 2 -1 | 1 3 4 |
Explanation
2 = 1 + 2 - 1 ⇒ position of 1 is 1, position of2 is 3, and the position of -1 is 4
Constraints
Time limit: 9.6 seconds
Memory limit: 512 MB
Output limit: 1 MB