Description

You are given an array of daily allowance amounts. Find if there exists a contiguous subarray that sums exactly to the target amount. If found, return the start and end indices of that subarray.

Input

Output

Constraints

• •1 <= array length <= 100,000
• •1 <= each element <= 10,000
• •1 <= target <= 10^9

Examples

allowance = [1, 4, 2, 3, 5, 1, 2], target = 10

[1, 3]