Madoka's father just reached 11 million subscribers on Mathub! So the website decided to send him a personalized award — The Mathhub's Bit Button!
The Bit Button is a rectangular table with nn rows and mm columns with 00 or 11 in each cell. After exploring the table Madoka found out that:
For example, in the first illustration the red subrectangle is nice, but in the second one it's not, because it's contained in the purple subrectangle.
Help Madoka to determine whether the table is elegant.
Each test contains multiple test cases. The first line contains a single integer tt (1≤t≤2001≤t≤200) — the number of test cases. Desc
The first line of each test case contains two positive integers n,mn,m (1≤n,m≤1001≤n,m≤100).
The next nn lines contain strings of length mm consisting of zeros and ones — the desc
It is guaranteed that the sum of the values of nn and the sum of the values of mm for all test cases do not exceed 777777.
For each test case print "YES" if its table is elegant or print "NO" otherwise.
You may print each letter in any case (for example, "YES", "Yes", "yes", "yEs" will all be recognized as positive answer).
5
3 3
100
011
011
3 3
110
111
110
1 5
01111
4 5
11111
01010
01000
01000
3 2
11
00
11
YES
NO
YES
NO
YES
In the second test case the table is not elegant, because the red and the purple subrectangles are nice and intersect.
In the fourth test case the table is not elegant, because the red and the purple subrectangles are nice and intersect.