poj2893

 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+9;
const int maxm=1e6;
const int mod=1e9+7;

int a[maxn];

int c[maxn];

void add(int x,int val)
{
    while(x<maxn)
    {
        c[x]+=val;
        x+=lowbit(x);
    }
}
int getsum(int x)
{
    int ans=0;
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans;
}
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int n,m;
    while(~scanf("%d%d",&n,&m)&&n&&m)
    {
        mem(c,0);
        int x=0;

        int ans=0;
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=m;j++)
            {
                int tmp;
                sfi(tmp);
                if(tmp==0)
                {
                    x=i;
                }
                else
                {
                    a[++cnt]=tmp;
                }
            }

        }

        for(int i=cnt;i>=1;i--)
        {
            ans+=getsum(a[i]-1);
            add(a[i],1);
        }


        if(m%2==0)
        {
            if((n-x)%2==(ans%2)) puts("YES");
            else puts("NO");
        }
        else
        {
            if(ans%2==0) puts("YES");
            else puts("NO");
        }


    }


    return 0;
}