Snuke is playing a puzzle game.
In this game, you are given a rectangular board of dimensions R × C, filled with numbers. Each integer i from 1 through N is written twice, at the coordinates (x_{i,1},y_{i,1}) and (x_{i,2},y_{i,2}).
The objective is to draw a curve connecting the pair of points where the same integer is written, for every integer from 1 through N.
Here, the curves may not go outside the board or cross each other.
Determine whether this is possible.

-----Constraints-----
 - 1 ≤ R,C ≤ 10^8
 - 1 ≤ N ≤ 10^5
 - 0 ≤ x_{i,1},x_{i,2} ≤ R(1 ≤ i ≤ N)
 - 0 ≤ y_{i,1},y_{i,2} ≤ C(1 ≤ i ≤ N)
 - All given points are distinct.
 - All input values are integers.

-----Input-----
Input is given from Standard Input in the following format:
R C N
x_{1,1} y_{1,1} x_{1,2} y_{1,2}
:
x_{N,1} y_{N,1} x_{N,2} y_{N,2}

-----Output-----
Print YES if the objective is achievable; print NO otherwise.

-----Sample Input-----
4 2 3
0 1 3 1
1 1 4 1
2 0 2 2

-----Sample Output-----
YES


The above figure shows a possible solution.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'def main():\n    import sys\n    input = sys.stdin.readline\n    \n    R,C,N = map(int,input().split())\n    P = []\n    X = {0,R}\n    Y = {0,C}\n    M = 0\n    for i in range(N):\n        x1,y1,x2,y2 = map(int,input().split())\n        if (x1 in X or y1 in Y) and  (x2 in X or y2 in Y):\n            if y1==0:\n                L1 = x1\n            elif x1==R:\n                L1 = R+y1\n            elif y1==C:\n                L1 = 2*R + C - x1\n            else:\n                L1 = 2*(R+C) - y1\n            \n            if y2==0:\n                L2 = x2\n            elif x2==R:\n                L2 = R+y2\n            elif y2==C:\n                L2 = 2*R + C - x2\n            else:\n                L2 = 2*(R+C) - y2\n                \n            P.append([min(L1,L2), max(L1,L2)])\n    P = sorted(P, key = lambda a:a[0])\n    M = len(P)\n    \n    flag = 0\n    Q = []\n    for i in range(M):\n        x1,x2 = P[i]\n        if Q == []:\n            Q.append([x1,x2])\n        else:\n            while Q!=[] and Q[-1][1] < x1:\n                Q.pop()\n            if Q==[]:\n                Q.append([x1,x2])\n            else:\n                y1,y2 = Q[-1]\n                if y2 < x2:\n                    flag = 1\n                    break\n                else:\n                    Q.append([x1,x2])\n    if flag == 1:\n        print("NO")\n    else:\n        print("YES")\n    \nmain()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14475