#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#include <unordered_set>
#include <unordered_map>

using namespace std;

#define all(c) ((c).begin()), ((c).end())
#define dump(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define REP(i, a, b) for (int i = a; i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define debug(fmt, ...) \
        fprintf( stderr, \
                  fmt "\n", \
                  ##__VA_ARGS__ \
        )

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int INF = 1 << 30;
const double EPS = 1e-10;

double zero(double d) {
    return abs(d) < EPS ? 0.0 : d;
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
    return os << '(' << p.first << ',' << p.second << ')';
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a) {
    os << '[';
    rep(i, a.size()) os << (i ? " " : "") << a[i];
    return os << ']';
}

string toString(int i) {
    stringstream ss;
    ss << i;
    return ss.str();
}

const int MOD = 1000000007;

// a^k
ll fpow(ll a, ll k, int M) {
    ll res = 1ll;
    ll x = a;
    while (k != 0) {
        if ((k & 1) == 1)
            res = (res * x) % M;
        x = (x * x) % M;
        k >>= 1;
    }
    return res;
}

struct prepare {
    prepare() {
        cout.setf(ios::fixed, ios::floatfield);
        cout.precision(8);
        ios_base::sync_with_stdio(false);
    }
} _prepare;


bool solve() {
    int R, C, N;
    cin >> R >> C >> N;

    auto xb = [&](int x) {
        return (x == 0 || x == R);
    };
    auto yb = [&](int y) {
        return (y == 0 || y == C);
    };

    vector<pair<pii, pii>> boundaries;
    vector<pii> top, left, right, bottom;
    rep(i, N) {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if ((xb(x1) || yb(y1)) && (xb(x2) || yb(y2))) {
            pii t1 = mp(x1, y1);
            pii t2 = mp(x2, y2);
            if (t1 > t2)
                swap(t1, t2);

            if (xb(x1)) {
                if (x1 == 0) top.push_back(mp(y1, i));
                else bottom.push_back(mp(y1, i));
            } else if (yb(y1)) {
                if (y1 == 0) left.push_back(mp(x1, i));
                else right.push_back(mp(x1, i));
            }

            if (xb(x2)) {
                if (x2 == 0) top.push_back(mp(y2, i));
                else bottom.push_back(mp(y2, i));
            } else if (yb(y2)) {
                if (y2 == 0) left.push_back(mp(x2, i));
                else right.push_back(mp(x2, i));
            }
        }
    }

    sort(all(top));
    sort(all(right));

    sort(all(bottom));
    reverse(all(bottom));
    sort(all(left));
    reverse(all(left));

    vi ary;

    tr(it, top)ary.push_back(it->second);
    tr(it, right)ary.push_back(it->second);
    tr(it, bottom)ary.push_back(it->second);
    tr(it, left)ary.push_back(it->second);

    stack<int> st;
    tr(it, ary) {
        if(st.empty() || st.top() != *it)
            st.push(*it);
        else
            st.pop();
    }

    return st.empty();
}

int main() {
    auto res = solve();
    if (res) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }

    return 0;
}


Measured memory_bytes: 3684