Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×
G. Sum of Two Values
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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,\dots, a_n$$$: the array values.

Constraints:

  • $$$2 \le n \le 2 \cdot 10^5$$$
  • $$$1 \le x,a_i \le 10^9$$$
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 $$$-1$$$.

Example
Input
4 8
2 7 5 1
Output
2 4