// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int R, C;
int N;
Pii A[MAXN], B[MAXN];

void input()
{
    read(R); read(C); read(N);
    for (int i = 1; i <= N; ++i) {
        read(A[i].x); read(A[i].y);
        read(B[i].x); read(B[i].y);
    }
}

vector<Pii> list;

inline bool onBorder(const Pii &a)
{
    return a.x == 0 || a.x == R || a.y == 0 || a.y == C;
}

inline void add(Pii &a, int x)
{
    if (a.x == 0)
        list.push_back(MP(a.y, x));
    else if (a.y == C)
        list.push_back(MP(a.x + C, x));
    else if (a.x == R)
        list.push_back(MP(-a.y + C + R + C, x));
    else
        list.push_back(MP(-a.x + C + R + C + R, x));
}

void solve()
{
    for (int i = 1; i <= N; ++i) {
        if (onBorder(A[i]) && onBorder(B[i])) {
            add(A[i], i);
            add(B[i], i);
        }
    }
    std::sort(ALL(list));

    static int st[MAXN];
    static bool vis[MAXN];
    int top = 0;

    for (int i = 0; i < SZ(list); ++i) {
        int t = list[i].y;
        // printf("(%d, %d)\n", i, t);
        if (!vis[t]) {
            vis[t] = true;
            st[++top] = t;
        } else if (st[top--] != t) {
            puts("NO");
            return;
        }
    }
    puts("YES");
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();
}

// 三五年时三五月，可怜杯酒不曾消。
//     -- 黄景仁《绮怀》


Measured memory_bytes: 4080