#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define each(i, a) for(auto &i : a)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#define line cout << "-----------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T>inline istream& operator>>(istream& is, deque<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }

int main() {
    init();
#define imp(x,y) (x%w==0||y%h==0)
    int h, w, n; cin >> h >> w >> n;
    vector<pair<int, int>> p;
    FOR(i, 0, n) {
        int sy, sx, gy, gx; cin >> sy >> sx >> gy >> gx;
        if (!imp(sx, sy) || !imp(gx, gy))continue;
        int sd = 0, gd = 0;
        if (sy == 0)sd += sx;
        else {
            sd += w;
            if (sx == w)sd += sy;
            else {
                sd += h;
                if (sy == h)sd += w - sx;
                else sd += w + h - sy;
            }
        }
        if (gy == 0)gd += gx;
        else {
            gd += w;
            if (gx == w)gd += gy;
            else {
                gd += h;
                if (gy == h)gd += w - gx;
                else gd += w + h - gy;
            }
        }
        p.emplace_back(sd, i);
        p.emplace_back(gd, i);
    }
    SORT(p);
    deque<int> deq;
    for (auto [d, num] : p) {
        if (!deq.empty() && deq.back() == num)deq.pop_back();
        else deq.push_back(num);
    }
    while (!deq.empty()) {
        if (deq[0] == deq[1]) {
            deq.pop_front();
            deq.pop_front();
        }
        else if (deq.front() == deq.back()) {
            deq.pop_front();
            deq.pop_back();
        }
        else break;
    }
    print(deq.empty() ? "YES" : "NO");

    return 0;
}

Measured memory_bytes: 5260