Problem B. Lawnmower

Problem

Alice and Bob have a lawn in front of their house, shaped as a rectangle of N by Mmetres. Each year, they try to cut the lawn in some interesting pattern. So far, they had to do it with shears, which was very time-consuming, but now they have a new automatic lawnmower with multiple settings, and they want to try it out.

The new lawnmower has a height setting - you can set it to any height h between 1 and 100 millimetres, and it will cut all the grass higher than h it encounters to height h. You run it by entering the lawn at any part of the edge of the lawn, and the lawnmower goes in a straight line, perpendicular to the edge of the lawn it entered, cutting grass in a swath 1m wide, until it exits the lawn on the other side.

Alice and Bob have a number of various patterns of grass that they could have on their lawn. For each of those, they want to know whether it's possible to cut the grass into this pattern with their new lawnmower. Each pattern is described by specifying the height of the grass on each 1m x 1m square of the lawn.

The grass is 100mm high on the whole lawn initially.

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a line containing two numbers: N and M. Next follow N lines, with the ith line containing M numbers a_i,j each, the number a_i,j describing the desired height of the grass in the jth square of the ith row.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is either the word "YES" if it's possible to get the x-th pattern using the lawnmower, or "NO", if it's impossible (quotes for clarity only).

Limits

1 ≤ T ≤ 100.

Small dataset

1 ≤ N, M ≤ 10.
1 ≤ a_i,j ≤ 2.

Large dataset

1 ≤ N, M ≤ 100.
1 ≤ a_i,j ≤ 100.

Input	Output
3 3 3 2 1 2 1 1 1 2 1 2 5 5 2 2 2 2 2 2 1 1 1 2 2 1 2 1 2 2 1 1 1 2 2 2 2 2 2 1 3 1 2 1	Case #1: YES Case #2: NO Case #3: YES

题解：不能剪的条件就是，当且仅当存在草坪，其行、列中都有比他高度高的草坪。第一遍读入的时候以h[][]存行列最大值（m+n个元素）。第二遍再扫描，有上述草坪即停止，输出NO，没有则YES