#include <bits/stdc++.h>
using namespace std;
const int N = 1003;
typedef long long ll;
ll a[N][N], m, n, ni[1000003], num = 0, sum = 0, x, y, tep[10000003];
void conquer(int l, int mid, int r) {
    int p1 = l, p2 = mid + 1;
    int i = l;
    while (p1 <= mid && p2 <= r) {
        if (ni[p1] < ni[p2]) {
            tep[i++] = ni[p1++];
        } else {
            sum += (mid - p1 + 1);
            tep[i++] = ni[p2++];
        }
    }
    for (int j = p1; j <= mid; j++) tep[i++] = ni[j];
    for (int j = p2; j <= r; j++) tep[i++] = ni[j];
    for (int j = l; j <= r; j++) ni[j] = tep[j];
}
void devide(int l, int r) {
    if (l == r) {
        return;
    }
    int mid = (l + r) / 2;
    devide(l, mid);
    devide(mid + 1, r);
    conquer(l, mid, r);
}
int main() {
    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) {
                num++;
                ni[num] = a[i][j];
            } else {
                x = i;
                y = j;
            }
        }
    }
    devide(1, num);
    if (m % 2 != 0) {
        if (sum % 2 == 0)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    } else {
        if ((sum + abs(x - n)) % 2 == 0)
            cout << "YES" << endl;
        else {
            cout << "NO" << endl;
        }
    }
}