Problem of the day
[ [1, 2, 5],
[3, 4, 9],
[6, 7, 10]]
We have to find the position of 4. We will return {1,1} since A[1][1] = 4.
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.
For each test case, print the position of 'X', if it exists, otherwise print “-1 -1”.
1 ≤ T ≤ 10
1 ≤ N ≤ 10^3
1 ≤ X ≤ 10^6
1 ≤ Aij ≤ 10^6
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.
Time Limit : 1 sec
It is guaranteed that the matrix contains distinct elements.
You are not required to print the expected output, it has already been taken care of. Just implement the function.
2
3 4
1 2 5
3 4 9
6 7 10
2 5
4 5
8 6
1 1
0 1
The first test case is already explained in the problem statement.
The second test case, the given matrix is:
[[4, 5],
[5, 6]]
We have to find the position of 5. So we return {0,1}.
2
3 16
2 4 8
3 6 9
4 7 16
1 10
4
2 2
-1 -1