当前没有测试数据。

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 Format

The first input line has two integers n and x: the array size and the target sum.

The second line has n integers a1,a2,…,an: the array values.

Output Format

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.

4 8
2 7 5 1

2 4

Hint

<li> 1≤n≤2⋅10⁵ </li> <li> 1≤x,a_i≤10⁹ </li>

Source

CSES