SP18450 MXSBMTRX - Largest Increasing Sub-Matrix

Mosa loves all sorts of properties of matrices. One day his coach Fegla asked him to draw a matrix with size N × M and insert random numbers in each cell, then he asked him to find the largest increasing sub-matrix. It's defined as a matrix that each cell in the position (i, j) is greater than the cells in positions: (i - 1, j), (i, j - 1) and (i - 1, j - 1).  Help Mosa to find the size of the largest increasing sub-matrix.

**t** - the number of test cases, then t test cases follows. \[**t**

For each test case in the input your program must print on single line, containing the solution of the problem.