You are given an N * N matrix of integers where each row and each column is sorted in increasing order. You are given a target integer 'X'. Find the position of 'X' in the matrix, if it exists then return the pair {i, j} where 'i' represents the row and 'j' represents the column of the array, otherwise return {-1,-1}

Input Format:

The first line of input contains a single integer 'T', representing the number of test cases or queries to be run. Then the 'T' test cases follow. The first line of each test case contains two space-separated integers 'N' and 'X', representing the size of the matrix and the target element respectively. Each of the next 'N' lines contains 'N' space-separated integers representing the elements of the matrix.

Output Format:

For each test case, print the position of 'X', if it exists, otherwise print “-1 -1”.

Important Note:

You must write an algorithm with time complexity less than O(n²) and space complexity should be O(1).Two nested for loop solution will not be allowed.

Constraints:

1 ≤ T ≤ 10

1 ≤ N ≤ 10³

1 ≤ X ≤ 10⁶

1 ≤ A_ij ≤ 10⁶

where 'T' is the number of test cases, 'N' is the number of rows and columns, 'X' is the target value, and Aij is the elements of the matrix.