Given a matrix mat of size n x m, where every row and column is sorted in increasing order, and a number x is given. The task is to find whether element x is present in the matrix or not.
Expected Time Complexity : O(m + n)
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consists of three lines. First line of each test case consist of two space separated integers N and M, denoting the number of element in a row and column respectively. Second line of each test case consists of N*M space separated integers denoting the elements in the matrix in row major order. Third line of each test case contains a single integer x, the element to be searched.
Corresponding to each test case, print in a new line, 1 if the element x is present in the matrix, otherwise simply print 0.
1 <= T <= 200
1 <= N, M <= 30
1 <= mat <= 100
1<= X <= 100
3 30 38 44 52 54 57 60 69
18 21 27 38 55 67
Testcase 1: 62 is not present in the matrix, so output is 0.
Testcase 2: 55 is present in the matrix at 5th cell.
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.