You are given an array **A** of size **N**. You need to find **all pairs** in the array that sum to a number **K**. If no such pair exists then output will be **-1**. The elements of the array are **distinct **and are in **sorted **order.

**Note:** (a,b) and (b,a) are considered same. Also, an element cannot pair with itself, i.e., (a,a) is invalid.

**Input:**

The first line of input is **T** denoting the number of testcase. **T** testcases follow. Each testcase contains **three **lines of input. The first line is the size of array N. The second line contains N elements separated by spaces. The third line contains the sum K.

**Output:**

For each testcase, print all the pairs such that there sum is equal to K.

**Constraints:**

1 <= T <= 100

0 <= A_{i} <=10^{7}

2 <= N <= 10^{7}

0 <= K <= 10^{7}

**Examples:**

**Input:**

2

7

1 2 3 4 5 6 7

98

7

1 2 3 4 5 6 7

8

**Output:**

-1

1 7 8

2 6 8

3 5 8

**Explanation:
Testcase1: **We cannot find any pair that sums to 98

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

SashaV | 206 |

VivSisMMM | 204 |

GustavoMéndez | 191 |

d_Coder00 | 189 |

GHJKL | 174 |

Pulkit__Sharma__ | 726 |

Anirban166 | 677 |

Found_me | 582 |

abducodes | 566 |

Sathvik Avasarala | 518 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.