Database

Peter studies the theory of relational databases. A table in a relational database consists of values arranged in rows and columns.

There are several normal forms that a database may follow. Normal forms are designed to minimize the redundancy of data in a database. For example, a library database table might have one row per book and columns for the book name, the book's author, and the author's email.

If the same author wrote several books, this representation is clearly redundant. To define this kind of redundancy formally, Peter introduced his own normal form. A table is in Peter's Normal Form (PNF) if and only if there is no pair of rows together with a pair of columns such that the values in those two columns are the same for both rows.

Such a library table is clearly not in PNF, because the values in the author-name column and the email column repeat across two different rows. However, if we introduce a unique author identifier and split the table into two tables — one holding the book name and the author id, and the other holding the author id, the author name, and the author email — then both resulting tables are in PNF.

Given a table, determine whether it is in PNF.

The first line contains two integers n and m (1 ≤ n ≤ 10 000, 1 ≤ m ≤ 10), the number of rows and columns of the table. Each of the next n lines contains one row. Each row consists of m column values separated by commas. Column values consist of ASCII characters from space (ASCII code 32) to tilde (ASCII code 126), excluding the comma (ASCII code 44). Values are non-empty and have no leading or trailing spaces. Each row has at most 80 characters (including the separating commas).

If the table is in PNF, print YES on a single line.

Otherwise print three lines. On the first line print NO. On the second line print two row numbers r1 and r2 (r1 < r2), and on the third line print two column numbers c1 and c2 (c1 < c2), such that rows r1 and r2 have equal values in column c1 and equal values in column c2. Because several such violating tuples may exist, print only the lexicographically smallest tuple (r1, r2, c1, c2): minimize r1 first, then r2, then c1, then c2.