Given a sorted array, find two elements that sum to a target value k using the two-pointer technique.

Problem Description

Given sorted array of N integers on line 2 and target K on line 3, find two 0-based indices that sum to K using two pointers. Print 'i j' or '-1'. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

• -10^9 <= N <= 10^9

Examples