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.

Examples

Input

4 2 3
0 1 3 1
1 1 4 1
2 0 2 2


Output

YES


Input

2 2 4
0 0 2 2
2 0 0 1
0 2 1 2
1 1 2 1


Output

NO


Input

5 5 7
0 0 2 4
2 3 4 5
3 5 5 2
5 5 5 4
0 3 5 1
2 2 4 4
0 5 4 1


Output

YES


Input

1 1 2
0 0 1 1
1 0 0 1


Output

NO
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Stack;
import java.util.StringTokenizer;

public class Main {
	
	
	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
	
		int R = sc.nextInt(), C = sc.nextInt(), N = sc.nextInt();
		Point[] pts = new Point[N << 1];
		int sz = 0;
		for(int i = 0, j = 0; i < N; ++i)
		{
			Point p = new Point(sc.nextInt(), sc.nextInt()), q = new Point(sc.nextInt(), sc.nextInt());
			if(p.onBoundary(R, C) && q.onBoundary(R, C))
			{
				pts[sz << 1] = p;
				pts[sz << 1 | 1] = q;
				p.idx = q.idx = sz++;
			}
		}
		pts = Arrays.copyOf(pts, sz << 1);
		for(int i = 0; i < sz << 1; ++i)
			pts[i].setFrameIndex(R, C);
		Arrays.sort(pts);
		boolean possible = true, open[] = new boolean[sz];
		Stack<Integer> s = new Stack<>();
		for(Point p: pts)
			if(!open[p.idx])
			{
				open[p.idx] = true;
				s.push(p.idx);
			}
			else if(s.pop() != p.idx)
			{
				possible = false;
				break;
			}
		out.println(possible ? "YES" : "NO");
		out.close();
	}
	
	static class Point implements Comparable<Point>
	{
		int x, y, idx, frameIndex;
		
		Point(int a, int b) { x = a; y = b; }
		
		boolean onBoundary(int R, int C) { return x == 0 || x == R || y == 0 || y == C; }
		
		void setFrameIndex(int R, int C)
		{
			if(y == 0)
				frameIndex = x;
			else if(x == R)
				frameIndex = R + y;
			else if(y == C)
				frameIndex = R + C + R - x;
			else
				frameIndex = R + C + R + C - y;
		}
		
		public int compareTo(Point p) { return frameIndex - p.frameIndex; }
	}
		
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public Scanner(String s) throws FileNotFoundException{	br = new BufferedReader(new FileReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException {return Integer.parseInt(next());}

		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}

		public double nextDouble() throws IOException { return Double.parseDouble(next()); }

		public boolean ready() throws IOException {return br.ready();} 
	}
}