Given an unsorted array **A **of size **N** of non-negative integers, find a continuous sub-array which adds to a given number **S**.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. Then **T** test cases follow. Each test case consists of two lines. The first line of each test case is **N **and** S**, where N is the size of array and S is the sum. The second line of each test case contains **N** space separated integers denoting the array elements.

**Output:**

For each testcase, in a new line, print the **starting and ending positions**(**1** indexing) of **first such occuring subarray from the left** if sum equals to subarray, else print** -1**.

**Constraints:**

1 <= T <= 100

1 <= N <= 10^{7}

1 <= A_{i} <= 10^{10}

**Example:**

**Input:**

2

5 12

1 2 3 7 5

10 15

1 2 3 4 5 6 7 8 9 10

**Output:**

2 4

1 5

**Explanation : **

**Testcase1:** sum of elements from 2nd position to 4th position is 12

**Testcase2:** sum of elements from 1st position to 5th position is 15

lakshmi_pandey | 72 |

abbatta7 | 68 |

Ashish Kumar Vaishy | 62 |

aman19 | 58 |

Kumar Gaurav Singh | 58 |

saumitra13325 | 612 |

ashujack | 551 |

lakshmi_pandey | 544 |

aman19 | 538 |

piyushmittal25 | 514 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.