#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int w, h, n;
	cin >> w >> h >> n;
	auto f = [&](int x, int y)
	{
		if (y == 0)
			return x;
		if (x == w)
			return w + y;
		if (y == h)
			return w + h + (w - x);
		if (x == 0)
			return w + h + w + (h - y);
		return -1;
	};
	vector<PII> vec;
	FOR(i, 0, n)
	{
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		int f1 = f(x1, y1), f2 = f(x2, y2);
		if (f1 != -1 && f2 != -1)
		{
			vec.PB({f1, i});
			vec.PB({f2, i});
		}
	}
	sort(ALL(vec));
	stack<int> s;
	for (auto [_, i] : vec)
	{
		if (!s.empty() && s.top() == i)
			s.pop();
		else
			s.push(i);
	}
	cout << (s.empty() ? "Y\n" : "N\n");
	return 0;
}