#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int a[1000000];
int tmp[1000000];

long long merge_sort(int q[], int l, int r) {
    if (l >= r)
        return 0;

    int mid = l + r >> 1;

    long long res = merge_sort(q, l, mid) + merge_sort(q, mid + 1, r);

    int k = 0, i = l, j = mid + 1;
    while (i <= mid && j <= r)
        if (q[i] <= q[j])
            tmp[k++] = q[i++];
        else {
            res += mid - i + 1;
            tmp[k++] = q[j++];
        }
    while (i <= mid) tmp[k++] = q[i++];
    while (j <= r) tmp[k++] = q[j++];

    for (i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j];

    return res;
}

int main() {
    int n, m, c = 0, b = 0;
    cin >> n >> m;
    int y;
    for (int i = 0, j = 0; j < n * m; i++, j++) {
        int w;
        scanf("%d", &w);
        if (w == 0) {
            y = j / m + 1;
            i--;
        } else {
            a[i] = w;
        }
    }
    int sum = merge_sort(a, 0, n * m - 2) % 2;

    if (sum == 0 && m % 2 == 1)
        cout << "YES";
    else if (m % 2 == 0 && (n - y + sum) % 2 == 0)
        cout << "YES";
    else
        cout << "NO";
    return 0;
}