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

const int N = 1e6 + 7;
long long a[1001][1001];
long long nums[N];
long long temp[N];
int st;
long long result = 0;

void merge_sort(int l, int r) {
    if (l >= r)
        return;
    int mid = (l + r) / 2;
    merge_sort(l, mid);
    merge_sort(mid + 1, r);

    int l1 = l, r1 = mid + 1, temp1 = 0;
    while (l1 <= mid && r1 <= r) {
        if (nums[l1] <= nums[r1]) {
            temp[temp1++] = nums[l1++];
        } else {
            result += mid - l1 + 1;
            temp[temp1++] = nums[r1++];
        }
    }
    while (l1 <= mid) temp[temp1++] = nums[l1++];
    while (r1 <= r) temp[temp1++] = nums[r1++];
    for (int i = l; i <= r; i++) nums[i] = temp[i - l];
}

int main() {
    int n, m;
    cin >> n >> m;
    int cnt = 0;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            scanf("%lld", &a[i][j]);
            if (a[i][j] == 0) {
                st = n - i + 1;  // 空格行号（从下往上）
            } else {
                nums[cnt++] = a[i][j];
            }
        }
    }

    merge_sort(0, cnt - 1);
    bool res;
    if (m % 2 == 1) {
        res = (result % 2 == 0);
    } else {
        res = ((result + st) % 2 == 1);
    }

    cout << (res ? "YES" : "NO") << endl;
    return 0;
}