Shift all zeros to the end of the array.

Difficulty: Hard

Phase: 6 · Mixed Logical Challenges

XP Reward: 30 XP

Topics: Mixed Logical Challenges, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given sorted array of N integers and target K, find two 0-based indices whose elements sum to K. If found print 'i j', else '-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

Example 1

Input: 5 1 2 3 4 6 6

Output: 1 3

Explanation: Sample execution for input 5 1 2 3 4 6 6