Given an integer array of size **N**. For each element in the array, check whether the right adjacent element (on the next immediate position) of the array is smaller. If next element is smaller, print that element. If not, then print -1.

**Input:**

The first line of input contains an integer **T** denoting the number of test cases. **T **testcases follow. Each testcase contains 2 lines of input:

The first line contains an integer **N**, where **N** is the size of array.

The second line contains **N** integers(elements of the array) sperated with spaces.

**Output:**

For each test case, print the next immediate smaller elements for each element in the array.

**Constraints:**

1 ≤ T ≤ 200

1 ≤ N ≤ 10^{7}

1 ≤ arr[i] ≤ 1000

**Example:**

**Input**

2

5

4 2 1 5 3

6

5 6 2 3 1 7

**Output**

2 1 -1 3 -1

-1 2 -1 1 -1 -1

Explanation:

Testcase 1: Array elements are 4, 2, 1, 5, 3. Next to 4 is 2 which is smaller, so we print 2. Next of 2 is 1 which is smaller, so we print 1. Next of 1 is 5 which is greater, so we print -1. Next of 5 is 3 which is smaller so we print 3. Note that for last element, output is always going to be -1 because there is no element on right.

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.

VivSisMMM | 164 |

d_Coder00 | 163 |

ajayjadhav35 | 153 |

Astikeysingh | 148 |

Sathvik Avasarala | 143 |

Pulkit__Sharma__ | 658 |

Anirban166 | 565 |

abducodes | 542 |

Sathvik Avasarala | 506 |

Found_me | 494 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.