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

**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

SushmitaRaj | 61 |

svashish305 | 54 |

Mr_Bean | 49 |

deepaksh0607 | 48 |

MuhammadHasan | 43 |

kinetic | 317 |

yirans | 278 |

kevinyu102589 | 263 |

rutvik29 | 217 |

kyaba-kun | 206 |

akhayrutdinov | 4913 |

Ibrahim Nash | 4431 |

Quandray | 4261 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.