/*input
4 2 3
0 1 3 1
1 1 4 1
2 0 2 2
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define int long long 
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back

#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)

#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;

typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;

const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;

int raise(int a,int n,int m = MOD){
  if(n == 0)return 1;
  if(n == 1)return a;
  int x = 1;
    x *= raise(a,n/2,m);
    x %= m;
    x *= x;
    x %= m;
    if(n%2)x*= a;
    x %= m;
    return x;
}

int floor1(int n,int k){
    if(n%k == 0 || n >= 0)return n/k;
    return (n/k)-1;
}

int ceil1(int n,int k){
    return floor1(n+k-1,k);
}

const int N = 1e5+1;
int r,c;
vector<pair<int,int> > top;
vector<pair<int,int> > bottom;
vector<pair<int,int> > lef;
vector<pair<int,int> > rig;
int n;
int x[N][2];
int y[N][2];

bool cmp(pii a,pii b){
	if(a.s == b.s)return a.f < b.f;
	return a.s < b.s;
}

bool cmp2(pii a,pii b){
	if(a.s == b.s)return a.f < b.f;
	return a.s > b.s;
}

vector<int> all;
int freq[N];
stack<int> nice;
int done[N];

void solve(){
  	cin >> r >> c >> n;
  	RE(i,n){
  		REP(j,2){
  			cin >> x[i][j] >> y[i][j];
  			if(!y[i][j]){
  				bottom.pb({i,x[i][j]});
  				freq[i]++;
  			}
  			else if(!x[i][j]){
  				lef.pb({i,y[i][j]});freq[i]++;
  			}
  			else if(x[i][j] == r){
  				rig.pb({i,y[i][j]});freq[i]++;
  			}
  			else if(y[i][j] == c){
  				top.pb({i,x[i][j]});freq[i]++;
  			}
  		}
  	}
  	sort(all(bottom),cmp);
  	sort(all(rig),cmp);
  	sort(all(top),cmp2);
  	sort(all(lef),cmp2);
  	for(auto it:bottom){
  		if(freq[it.f] == 1)continue;
  		all.pb(it.f);
  	}
  	for(auto it:rig){
  		if(freq[it.f] == 1)continue;
  		all.pb(it.f);
  	}
  	for(auto it:top){
  		if(freq[it.f] == 1)continue;
  		all.pb(it.f);
  	}
  	for(auto it:lef){
  		if(freq[it.f] == 1)continue;
  		all.pb(it.f);
  	}
  	for(auto heh:all){
  		if(done[heh]){
  			if(nice.top() == heh){
  				nice.pop();
  			}
  			else {
  				cout << "NO";
  				return;
  			}
  		}
  		else{
  			done[heh] = 1;
  			nice.push(heh);
  		}
  	}
  	cout << "YES";
  	
}

signed main(){
  ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  //freopen(".in","r",stdin);freopen(".out","w",stdout);
  int t = 1;
  //cin >> t;
  while(t--){
    solve();
  }
  return 0;
}

Measured memory_bytes: 11948