CF1492E.Almost Fault-Tolerant Database

You are storing an integer array of length $m$ in a database. To maintain internal integrity and protect data, the database stores $n$ copies of this array.

Unfortunately, the recent incident may have altered the stored information in every copy in the database.

It's believed, that the incident altered at most two elements in every copy. You need to recover the original array based on the current state of the database.

In case there are multiple ways to restore the array, report any. If there is no array that differs from every copy in no more than two positions, report that as well.

你正在数据库中存储一个长度为 $m$ 的整数数组。为维护内部完整性并保护数据，该数据库存储了该数组的 $n$ 份副本。

不幸的是，最近发生的事故可能已修改了数据库中每一份副本所存储的信息。

据信，此次事故在每份副本中至多修改了两个元素。你需要根据数据库当前的状态恢复原始数组。

若存在多种方式可恢复该数组，则输出任意一种即可；若不存在任何一个数组，使得它与每份副本的差异位置数均不超过两个，则也请报告这一情况。

The first line contains integers $n$ and $m$ ($2 \le n$; $1 \le m$; $n \cdot m \le 250\,000$) — the number of copies and the size of the array.

Each of the following $n$ lines describes one of the currently stored copies in the database, it consists of $m$ integers $s_{i, 1}, s_{i, 2}, \dots, s_{i, m}$ ($1 \le s_{i, j} \le 10^9$).

第一行包含两个整数 $n$ 和 $m$（$2 \le n$；$1 \le m$；$n \cdot m \le 250\,000$），分别表示副本数量和数组大小。

接下来的 $n$ 行每行描述数据库中当前存储的一个副本，每行包含 $m$ 个整数 $s_{i, 1}, s_{i, 2}, \dots, s_{i, m}$（$1 \le s_{i, j} \le 10^9$）。

If there is an array consistent with all given copies, print "Yes" and then the array itself. The array must have length $m$ and contain integers between $1$ and $10^9$ only.

Otherwise, print "No".

If there are multiple possible arrays, print any of them.

如果存在一个与所有给定副本一致的数组，则输出“Yes”，然后输出该数组本身。该数组长度必须为 $m$，且仅包含介于 $1$ 和 $10^9$ 之间的整数。

否则，输出“No”。

若存在多个可能的数组，输出其中任意一个即可。

In the first example, the array $[1, 10, 1, 100]$ differs from first and second copies in just one position, and from the third copy in two positions.

In the second example, array $[1, 1, 1, 1, 1, 1, 1]$ is the same as the first copy and differs from all other copies in at most two positions.

In the third example, there is no array differing in at most two positions from every database's copy.

在第一个例子中，数组 $[1, 10, 1, 100]$ 与第一份和第二份副本仅在一个位置上不同，而与第三份副本在两个位置上不同。

在第二个例子中，数组 $[1, 1, 1, 1, 1, 1, 1]$ 与第一份副本完全相同，且与其余所有副本至多在两个位置上不同。

在第三个例子中，不存在一个数组，使得它与数据库中每一份副本至多在两个位置上不同。