First and Last Position of an Element in a Sorted Array

Given a sorted array/list ARR consisting of ‘N’ elements, and an integer ‘K’, your task is to find the first and last occurrence of ‘K’ in ARR.

Explanation

• If the element ‘K’ is not present in the array, then both the first and the last occurrence will be -1.
• The array may contain duplicate elements.

Input

The first line of input contains an integer 'T' which denotes the number of test cases. Then the test cases follow. The first line of each test case contains two space-separated integers ‘N’ and ‘K’. The second line of each test case contains ‘N’ space-separated integers denoting the elements of the array/list ARR.

Output

Return two space-separated integers denoting the first and last occurrence of ‘K’ in ARR, respectively.

Example

For example, if ARR = [0, 1, 1, 5] and K = 1, then the first and last occurrence of 1 will be at indexes 1 and 2 (0-indexed).

Constraints

• 1 <= T <= 100
• 1 <= N <= 5000
• 0 <= K <= 10^5
• 0 <= ARR[i] <= 10^5
• Time Limit: 1 second

Note

You do not need to print anything; it has already been taken care of. Just implement the given function.