#include <stdio.h>
#include <stdlib.h>

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

long long merge_sort(int arr[], int temp[], int left, int right) {
    long long inv_count = 0;
    if (left < right) {
        int mid = left + (right - left) / 2;
        inv_count += merge_sort(arr, temp, left, mid);
        inv_count += merge_sort(arr, temp, mid + 1, right);
        inv_count += merge(arr, temp, left, mid + 1, right);
    }
    return inv_count;
}

long long count_inversions(int arr[], int len) {
    int *temp = (int *)malloc(len * sizeof(int));
    long long inv_count = merge_sort(arr, temp, 0, len - 1);
    free(temp);
    return inv_count;
}

int main() {
    int n, m;
    scanf("%d %d", &n, &m);
    int total = n * m;
    int *board = (int *)malloc(total * sizeof(int));
    int row_zero = -1, idx = 0;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            scanf("%d", &board[idx]);
            if (board[idx] == 0)
                row_zero = i;
            idx++;
        }
    }

    int len = total - 1;
    int *arr = (int *)malloc(len * sizeof(int));
    int pos = 0;
    for (int i = 0; i < total; i++) {
        if (board[i] != 0)
            arr[pos++] = board[i];
    }
    free(board);

    long long inv_count = count_inversions(arr, len);
    free(arr);

    int possible;
    if (m % 2 == 1) {
        possible = (inv_count % 2) == 0;
    } else {
        int row_diff = (n - 1 - row_zero);
        possible = ((inv_count + row_diff) % 2) == 0;
    }

    printf(possible ? "YES\n" : "NO\n");
    return 0;
}