You are putting away an integer cluster of length m in an information base. To keep up with interior trustworthiness and secure information, the data set stores n duplicates of this cluster. Shockingly, the new episode might have modified the put away data in each duplicate in the data set. It's accepted, that the occurrence adjusted all things considered
Correct answer will be upvoted else downvoted. Computer science.
You are putting away an integer cluster of length m in an information base. To keep up with interior trustworthiness and secure information, the data set stores n duplicates of this cluster.
Shockingly, the new episode might have modified the put away data in each duplicate in the data set.
It's accepted, that the occurrence adjusted all things considered two components in each duplicate. You wanted to recuperate the first exhibit dependent on the present status of the data set.
On the off chance that there are different ways of reestablishing the cluster, report any. In case there is no cluster that contrasts from each duplicate in close to two positions, report that too.
Input
The main line contains integers n and m (2≤n; 1≤m; n⋅m≤250000) — the number of duplicates and the size of the exhibit.
Every one of the accompanying n lines portrays one of the at present put away duplicates in the information base, it comprises of m integers si,1,si,2,… ,si,m (1≤si,j≤109).
Output
In case there is an exhibit predictable with every given duplicate, print "Yes" and afterward the actual cluster. The exhibit should have length m and contain integers somewhere in the range of 1 and 109 as it were.
In any case, print "No".
In case there are numerous potential exhibits, print any of them.
Step by step
Solved in 4 steps with 1 images
