#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1 << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;
int compress(vector< int > &x) {
	vector< int > xs = x;
	int N = x.size();
	sort(xs.begin(), xs.end());
	xs.erase(unique(xs.begin(), xs.end()), xs.end());
	for (int i = 0; i < N; i++) {
		x[i] = lower_bound(xs.begin(), xs.end(), x[i]) - xs.begin();
	}
	return xs.size();
}
int N, M, K, T, Q, H, W;
signed main() {
	cin >> H >> W >> N;
	vector< int > x1(N), x2(N), y1(N), y2(N);

	rep(i, N) cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];
	vector< int > x, y;
	M = 0;
	rep(i, N) {
		if ((x1[i] == 0 || x1[i] == H || y1[i] == 0 || y1[i] == W) && (x2[i] == 0 || x2[i] == H || y2[i] == 0 || y2[i] == W)) {
			x.push_back(x1[i]);
			x.push_back(x2[i]);
			y.push_back(y1[i]);
			y.push_back(y2[i]);
			++M;
		}
	}
	x.push_back(0);
	y.push_back(0);
	x.push_back(H);
	y.push_back(W);
	H = compress(x) - 1;
	W = compress(y) - 1;
	vector< int > index(H * 2 + W * 2, -1);
	//cout << x << y;
	rep(i, M * 2) {
		if (x[i] == 0 && y[i] < W) {
			index[y[i]] = i / 2;
		} else if (y[i] == W && x[i] < H) {
			index[W + x[i]] = i / 2;
		} else if (x[i] == H && y[i] > 0) {
			index[H + W * 2 - y[i]] = i / 2;
		} else {
			index[H * 2 + W * 2 - x[i]] = i / 2;
		}
	}
	//cout << index;
	vector< int > index2;
	rep(i, index.size()) if (index[i] != -1) index2.push_back(index[i]);
	string ans = "YES";
	//cout << index2;
	/*if (index2.size() > 0) {
		if (index2[0] == index2[1]) {
			rep(i, index2.size()) {
				if (i % 2 == 0) {
					if (index2[i] != index2[i + 1]) {
						ans = "NO";
						break;
					}
				}
			}
		} else {
			rep(i, index2.size()) {
				if (i & 1) {
					if (index2[i] != index2[(i + 1) % index2.size()]) {
						ans = "NO";
						break;
					}
				}
			}
		}
	}*/
	stack< int > s;
	rep(i, index2.size()) {
		if (!s.empty() && s.top() == index2[i]) {
			s.pop();
		} else {
			s.push(index2[i]);
		}
	}
	if (!s.empty()) {
		ans = "NO";
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 13744