#include <bits/stdc++.h>
#define int long long

using namespace std;
const int N = 1010;
int n, m;
int a[N][N];
int b[N * N], lb;
int c[N * N];
int hb(int l, int r) {
    if (l == r)
        return 0;
    int mid = (l + r) >> 1;
    int tot = hb(l, mid) + hb(mid + 1, r);
    int ln = l, rn = mid + 1, nn = l;
    while (ln <= mid and rn <= r) {
        if (b[ln] <= b[rn]) {
            c[nn] = b[ln];
            nn++;
            ln++;
        } else {
            tot += mid - ln + 1;
            c[nn] = b[rn];
            nn++;
            rn++;
        }
    }
    while (ln <= mid) {
        c[nn] = b[ln];
        nn++;
        ln++;
    }
    while (rn <= r) {
        c[nn] = b[rn];
        nn++;
        rn++;
    }
    for (int i = l; i <= r; i++) b[i] = c[i];
    return tot;
}
int zh() {
    int zhx = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (a[i][j] != 0)
                zhx += abs(i - (a[i][j] - 1) / m - 1);
    return zhx;
}
signed main() {
    std::ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j];
            if (a[i][j] != 0) {
                lb++;
                b[lb] = a[i][j];
            }
        }
    }
    int ju1 = hb(1, lb), ju2 = zh();
    if (m % 2 == 1) {
        if (ju1 & 1)
            cout << "NO";
        else
            cout << "YES";
    } else {
        if ((ju1 ^ ju2) & 1)
            cout << "NO";
        else
            cout << "YES";
    }
}