#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << (x) << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;

#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class L, class R> ostream& operator<<(ostream &os, map<L, R> P) { for(auto const &vv: P)os<<"("<<vv.first<<","<<vv.second<<")"; return os; }
template<class T> ostream& operator<<(ostream &os, array<T,3> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, set<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000001

int inf = 200000000;
int r,c;
int summ(array<int,3> f){
    int sumf = 0;
    if(!f[0]) sumf = f[1];
    else{
        sumf += inf;
        if(f[1] == c){
            sumf += f[0];
        }
        else{
            sumf += inf;
            if(f[0] == r){
                sumf += inf-1;
                sumf -= f[1];
            }
            else{
                sumf += inf;
                sumf += inf-1;
                sumf -= f[0];
            }
        }
    }
    return sumf;
}

bool srt(array<int,3> f, array<int,3> s){
    return summ(f) < summ(s);
    /* if(!f[0]){ */
    /*     if(s[0]) return 1; */
    /*     return f[1] < s[1]; */
    /* } */
    /* if(!s[0]) return 0; */
    /* if(f[1] == c){ */
    /*     if(s[1] != c) return 1; */
    /*     return f[0] < s[0]; */
    /* } */
    /* if(s[1] == c) return 0; */
    /* if(f[0] == r){ */
    /*     if(s[0] != r) return 1; */
    /*     return f[1] > s[1]; */
    /* } */
    /* if(s[0] == r) return 0; */
    /* if(!f[1]){ */
    /*     if(s[1]) return 1; */
    /*     return f[0] > s[0]; */
    /* } */
    /* if(!s[1]) return 0; */
    /* return 1; */
    assert(0);
}

bool sp(int x, int y){
    return !x || x == r || !y || y == c;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    sc(r,c,n);
    vector<array<int,3>> a;
    int it = 0;
    FOR(i,0,n){
        int x1,x2;
        int y1,y2;
        sc(x1,y1,x2,y2);
        if(sp(x1,y1) && sp(x2,y2)){
            a.push_back({x1,y1,it});
            a.push_back({x2,y2,it});
            ++it;
        }
    }
    sort(all(a),srt);
    /* whatis(a) */
    stack<int> st;
    bool w[it];
    memset(w,0,sizeof w);
    FORR(i,a){
        if(w[i[2]]){
            if(st.top() != i[2]){
                REE("NO")
            }
            st.pop();
        }
        else{
            st.push(i[2]);
            w[i[2]] = 1;
        }
    }
    cout << "YES\n";
}



Measured memory_bytes: 4724