#include <bits/stdc++.h>
using namespace std;

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int MOD2 = 1007681537;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";

const int maxn = 3e5 + 5;
const int magic = 320;
int r, c, n;
int x[maxn];
int y[maxn];
int z[maxn];
int t[maxn];
int m;
int le[maxn];
int ri[maxn];

int inborder(int i) {
    return (x[i] == 0 || x[i] == r || y[i] == 0 || y[i] == c) && (z[i] == 0 || z[i] == r || t[i] == 0 || t[i] == c);
}

int compare(pair<pi, int> a, pair<pi, int> b) {
    pi u = a.fi;
    pi v = b.fi;
    u = mp(u.fi - r / 2, u.se - c / 2);
    v = mp(v.fi - r / 2, v.se - c / 2);
    int fu = u.se < 0 || (!u.se && u.fi < 0);
    int fv = v.se < 0 || (!v.se && v.fi < 0);
    if (fu != fv) return !fu;
    return (long long) u.fi * v.se - (long long) u.se * v.fi >= 0;
}

int compare2(int i, int j) {
    if (le[i] / magic != le[j] / magic) return le[i] / magic < le[j] / magic;
    return ri[i] < ri[j];
}

int tot;
int cnt[maxn];
int id[maxn];

void add(int k) {
    cnt[k] ^= 1;
    if (cnt[k]) {
        tot++;
    }
    else {
        tot--;
    }
}

void solve() {
    cin >> r >> c >> n; r <<= 1, c <<= 1;
    vector<pair<pi, int> > pts;
    vi dc;
    FOR(i, 0, n) {
        cin >> x[i] >> y[i] >> z[i] >> t[i];
        x[i] <<= 1, y[i] <<= 1, z[i] <<= 1, t[i] <<= 1;
        if (inborder(i)) {
            pts.pb(mp(mp(x[i], y[i]), i));
            pts.pb(mp(mp(z[i], t[i]), i));
            dc.pb(i);
        }
    }
    sort(all(dc));
    sort(all(pts), compare);
    ms(le, -1), ms(ri, -1);
    FOR(i, 0, sz(pts)) {
        int ix = lower_bound(all(dc), pts[i].se) - dc.begin();
        id[i] = ix;
        if (!~le[ix]) {
            le[ix] = i;
        }
        else {
            ri[ix] = i;
        }
    }
    int m = sz(dc);
    FOR(i, 0, m) {
        if (le[i] > ri[i]) swap(le[i], ri[i]);
    }
    vi ver; FOR(i, 0, m) ver.pb(i);
    sort(all(ver), compare2);
    int ll = 0, rr = -1;
    FOR(ii, 0, m) {
        int i = ver[ii];
        while (ll > le[i]) add(id[--ll]);
        while (ll < le[i]) add(id[ll++]);
        while (rr > ri[i]) add(id[rr--]);
        while (rr < ri[i]) add(id[++rr]);
        if (tot) {
            cout << "NO\n";
            return;
        }
    }
    cout << "YES\n";
}

int main() {
    int JUDGE_ONLINE = 1;
    if (fopen("in.txt", "r")) {
        JUDGE_ONLINE = 0;
        assert(freopen("in.txt", "r", stdin));
        //assert(freopen("out.txt", "w", stdout));
    }
    else {
        ios_base::sync_with_stdio(0), cin.tie(0);
    }
    solve();
    if (!JUDGE_ONLINE) {
        //cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    }
    return 0;
}

Measured memory_bytes: 12304