#include <bits/stdc++.h>
using namespace std;

int mergeAndCount(vector<int>& arr, vector<int>& temp, int left, int mid, int right) {
    int i = left, j = mid + 1, k = left, inv_count = 0;
    while (i <= mid && j <= right) {
        if (arr[i] <= arr[j]) {
            temp[k++] = arr[i++];
        } else {
            temp[k++] = arr[j++];
            inv_count += (mid - i + 1);
        }
    }
    while (i <= mid) temp[k++] = arr[i++];
    while (j <= right) temp[k++] = arr[j++];
    for (i = left; i <= right; i++) arr[i] = temp[i];
    return inv_count;
}

int countInversions(vector<int>& arr, vector<int>& temp, int left, int right) {
    if (left >= right)
        return 0;
    int mid = (left + right) / 2;
    int inv_count = 0;
    inv_count += countInversions(arr, temp, left, mid);
    inv_count += countInversions(arr, temp, mid + 1, right);
    inv_count += mergeAndCount(arr, temp, left, mid, right);
    return inv_count;
}

bool isSolvable(vector<vector<int>>& board, int n, int m) {
    vector<int> flattened;
    int zeroRow = 0;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (board[i][j] == 0) {
                zeroRow = i;
            } else {
                flattened.push_back(board[i][j]);
            }
        }
    }

    vector<int> temp(flattened.size());
    int inv_count = countInversions(flattened, temp, 0, flattened.size() - 1);

    if (m % 2 == 1) {
        return inv_count % 2 == 0;
    } else {
        return (inv_count + (n - zeroRow)) % 2 == 1;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;
    vector<vector<int>> board(n, vector<int>(m));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++) cin >> board[i][j];

    cout << (isSolvable(board, n, m) ? "YES" : "NO") << '\n';
    return 0;
}