#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;
const int N=(1<<13)+7;
set<int>G[N];
bool DP[N],nDP[N];
int n,m,k;
void bt(int x,int p,int i,int y)
{
int X=x|p;
if(i==n)
{
if(X!=(1<<n)-1) return ;
G[x].insert(y);
return ;
}
bt(x,p,i+1,y);
if(i<n-1)
{
if(!(X&(1<<i))&&!(X&(1<<(i+1)))&&!(y&(1<<(i+1)))) bt(x,p|(1<<i)|(1<<(i+1)),i+1,y|(1<<(i+1)));
if(!(X&(1<<i))&&!(X&(1<<(i+1)))&&!(y&(1<<i))) bt(x,p|(1<<i)|(1<<(i+1)),i+1,y|(1<<i));
if(!(X&(1<<i))&&!(y&(1<<(i+1)))&&!(y&(1<<i))) bt(x,p|(1<<i),i+1,y|(1<<i)|(1<<(i+1)));
}
if(i>0&&!(X&(1<<i))&&!(y&(1<<(i-1)))&&!(y&(1<<i))) bt(x,p|(1<<i),i+1,y|(1<<i)|(1<<(i-1)));
}
set<int>S;
map<int,vector<int>>M;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m>>k;
for(int i=0;i<(1<<n);i++) bt(i,0,0,0);
for(int i=0;i<k;i++)
{
int x,y;
cin>>x>>y;
S.insert(y);
M[y].pb(x);
}
S.insert(m);
DP[0]=1;
int l=1;
for(auto p:S)
{
int X=0;
for(auto c:M[p]) X|=(1<<(c-1));
if(p-l>15)
{
vector<bool>is(3,0);
for(int i=0;i<(1<<n);i++)
{
if(DP[i]) is[__builtin_popcount(i)%3]=1;
}
for(int i=0;i<(1<<n);i++)
{
if(is[((p-l)*n+__builtin_popcount(i))%3]) DP[i]=1;
else DP[i]=0;
}
}
else
{
for(int j=0;j<p-l;j++)
{
memset(nDP,0,sizeof nDP);
for(int i=0; i<(1<<n); i++)
{
if(!DP[i]) continue;
for(auto x:G[i]) nDP[x]=1;
}
for(int i=0;i<(1<<n);i++) DP[i]=nDP[i];
}
}
memset(nDP,0,sizeof nDP);
for(int i=0;i<(1<<n);i++)
{
if(DP[i]&&!(i&X)) nDP[i|X]=1;
}
for(int i=0;i<(1<<n);i++) DP[i]=nDP[i];
l=p;
}
if(DP[(1<<n)-1]) cout<<"YES";
else cout<<"NO";
return 0;
}
