7509: [CSES Problem Set] Sum of Two Values
[Creator : ]
Description
You are given an array of $n$ integers, and your task is to find two values (at distinct positions) whose sum is $x$.
Input
The first input line has two integers $n$ and $x$: the array size and the target sum.
The second line has $n$ integers $a_1,a_2,…,a_n$: the array values.
The second line has $n$ integers $a_1,a_2,…,a_n$: the array values.
Output
Print two integers: the positions of the values. If there are several solutions, you may print any of them. If there are no solutions, print IMPOSSIBLE.
Constraints
$1≤n≤2 \times 10^5$
$1≤x,a_i≤10^9$
$1≤x,a_i≤10^9$
Sample 1 Input
4 8
2 7 5 1
Sample 1 Output
2 4
Sample 2 Input
1 2
1
Sample 2 Output
IMPOSSIBLE
Sample 3 Input
3 2
1 2 3
Sample 3 Output
IMPOSSIBLE
HINT
相同题目：CSES 1640。