#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 7;
int n, m;
vector<vector<int> >vec;
int diff(vector<int> &v1, vector<int> &v2)
{
    int cnt = 0;
    for (int i = 0; i < v1.size(); i++)
    {
        if (v1[i] != v2[i]) cnt++;
    }
    return cnt;
}
vector<int>Diff(vector<int> &v1, vector<int> &v2)
{
    vector<int>vec;
    for (int i = 0; i < v1.size(); i++)
    {
        if (v1[i] != v2[i]) vec.push_back(i);
    }
    return vec;
}
bool check(vector<int> &v)
{
    for (int i = 0; i < n; i++)
    {
        int cnt = 0, pos = -1;
        for (int j = 0; j < m; j++)
        {
            if (v[j] != vec[i][j]) cnt++;
            if (v[j] == -1) pos = j;
        }
        if (cnt > 3)
        {
            return false;
        }
        if (cnt == 3)
        {
            if (pos != -1) v[pos] = vec[i][pos];
            else return false;
        }
    }
    return true;
}
void Print(vector<int> &v)
{
    printf("Yes\n");
    for (int i = 0; i < m; i++)
    {
        if (v[i] == -1) printf("1 ");
        else printf("%d ", v[i]);
    }
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
    {
        vector<int>now; now.resize(m);
        for (int j = 0; j < m; j++)
        {
            scanf("%d", &now[j]);
        }
        vec.push_back(now);
    }
    int mx = 0, mx_id = 0;
    for (int i = 1; i < n; i++)
    {
        int cnt = diff(vec[0], vec[i]);
        if (mx < cnt)
        {
            mx = cnt;
            mx_id = i;
        }
    }
    if (mx <= 2) Print(vec[0]);
    else if (mx <= 4)
    {
        vector<int>now = Diff(vec[0], vec[mx_id]);
        for (auto i : now)
        {
            for (auto j : now)
            {
                if (i == j)
                    continue;
                vector<int>tmp = vec[mx_id];
                tmp[i] = -1;
                tmp[j] = vec[0][j];
                if (check(tmp))
                {
                    Print(tmp);
                    return 0;
                }

            }
        }
        printf("No\n");
    }
    else
    {
        printf("No\n");
    }
    return 0;
}
