//#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
/*#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")*/
//#pragma comment(linker, "/STACK:367077216")
#define _CRT_SECURE_NO_WARNINGS
#include <chrono>
#include <set>
#include <map>
#include <deque>
#include <string>
#include <cstdint>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <bitset>
#include <iomanip>
#include <numeric>
#include <time.h>//////////////
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
//#define endl '\n'
#define mp make_pair
#define pbc push_back
#define pob pop_back()
#define empb emplace_back
#define queuel queue<long long>
#define sqr(a) ((a) * (a))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pin(p) cin >> p.first >> p.second;
#define uniq(a) sort(all(a));(a).resize(unique(all(a)) - a.begin());
#define rev(v) reverse(v.begin(), v.end());
#define sout(s, c) for (auto i : s) cout << i << c;
#define pout(p) cout << p.first << " " << p.second;
#define er(v, l, r) erase(v.begin() + l, v.begin() + r);
#define vin(v) for (ll i = 0; i < v.size(); ++i) cin >> v[i];
#define vout(v, c) for (int i = 0; i < v.size(); ++i) cout << v[i] << c;
#define pushi(v, a) for (int i = 0; i < a.size(); ++i) v.push_back(a[i]);
#define fastio() ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); srand(time(NULL))
#define dab(v) for(auto i:v)cout<<i<<' ';
#define sp system("pause")
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
using namespace std;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++--++
mt19937 rnd(time(0) + 228 + 'k' + 'e' + 'k' + 'e' + 'r' + 'o' + 'f' + 'e' + 'y');
const ld EPS = 1e-10;
bool checkprime(int x)
{
	for (int i = 2; i * i <= x; ++i) if (x % i == 0) return 0;
	return 1;
}
const ld PI = acos(-1);
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
int mod = MOD7;
const int inf = 1e9;
const ll INF = 1e18;
#define int ll
int operator*(pair<int, int> a, pair<int, int> b)
{
	return a.first * b.second - a.second * b.first;
}
int len(pair<int, int> a)
{
	return sqr(a.first) + sqr(a.second);
}
vector<pair<int, int>> lft, dw, up, rg;
int r, c;
void lol(pair<pair<int, int>, int> a)
{
	if (a.first.first == 0)
	{
		lft.pbc({ a.first.second, a.second });
	}
	else if (a.first.second == 0)
	{
		dw.pbc({ a.first.first,a.second});
	}
	else if (a.first.first == r)
	{
		rg.pbc({ a.first.second, a.second });
	}
	else
	{
		up.pbc({ a.first.first, a.second });
	}
}
signed main()
{
	fastio();
	cin >> r >> c;
	int n;
	cin >> n;
	vector<pair<pair<int, int>, pair<int, int>>> a(n);
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i].first.first >> a[i].first.second >> a[i].second.first >> a[i].second.second;
	}
	vector<pair<int, int>> b;
	for (int i = 0; i < n; ++i)
	{
		bool f = 0;
		if (a[i].first.first == 0 || a[i].first.second == 0 || a[i].first.first == r || a[i].first.second == c)f = 1;
		if (!(a[i].second.first == 0 || a[i].second.second == 0 || a[i].second.first == r || a[i].second.second == c)) f = 0;
		if (!f) continue;
		lol({ a[i].first, i });
		lol({ a[i].second, i });
	}
	sort(all(dw));
	sort(all(rg));
	sort(rall(up));
	sort(rall(lft));
	vector<int> st;
	for (auto i : dw) b.pbc(i);
	for (auto i : rg) b.pbc(i);
	for (auto i : up) b.pbc(i);
	for (auto i : lft) b.pbc(i);
	for (auto i : b)
	{
		if (!st.size()) st.pbc(i.second);
		else
		{
			if (st.back() == i.second) st.pob;
			else st.pbc(i.second);
		}
	}
	cout << (st.size() ? "NO" : "YES");
	sp;
}

Measured memory_bytes: 15304