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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

ll R, C, N;
vi _x1, _y1, _x2, _y2;

ll f(ll a, ll b){
    if (a == 0) {
        return b;
    } else if (a == R) {
        return C+R+(C-b);
    }
    if (b == 0) {
        return C+R+C+(R-a);
    } else if (b == C) {
        return C+a;
    }
    return -1;
}

bool solve() {
    vector<pair<ll,int>> tmp;
    rep(i,N){
        ll p1 = f(_x1[i], _y1[i]),
           p2 = f(_x2[i], _y2[i]);
        if (p1 == -1 || p2 == -1) continue;
        tmp.pb(cons(p1,1+i)); tmp.pb(cons(p2,1+i));
        // printf("%d: %lld - %lld\n", 1+i, p1, p2);
    }
    sort(ALL(tmp));
#ifdef DEBUG
    cerr << tmp << endl;
#endif
    stack<int> st;
    for (auto p : tmp) {
        int x = p.second;
        if (!st.empty() && st.top() == x) st.pop();
        else st.push(x);
    }
    return st.empty();
}

int main() {
    cin >> R >> C >> N;
    _x1.resize(N);
    _y1.resize(N);
    _x2.resize(N);
    _y2.resize(N);
    rep(i,N){
        cin >> _x1[i] >> _y1[i] >> _x2[i] >> _y2[i];
    }
    cout << (solve() ? "YES":"NO") << endl;
    return 0;
}


Measured memory_bytes: 8048