Codeforces 55C Pie or die （博弈）

C. Pie or die

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Volodya and Vlad play the following game. There are k pies at the cells of n  ×  m board. Each turn Volodya moves one pie to the neighbouring (by side) cell. If the pie lies at the border of the board then Volodya can move it outside the board, get the pie and win. After Volodya's move, Vlad bans some edge at the border of the board of length 1 (between two knots of the board) so that Volodya is not able to move the pie outside the board through this edge anymore. The question is: will Volodya win this game? We suppose both players follow the optimal strategy.

Input

First line contains 3 integers, separated by space: 1 ≤ n, m ≤ 100 — dimensions of the board and 0 ≤ k ≤ 100 — the number of pies. Each of the next k lines contains 2 integers, separated by space: 1 ≤ x ≤ n, 1 ≤ y ≤ m — coordinates of the corresponding pie. There could be more than one pie at a cell.

Output

Output only one word: "YES" — if Volodya wins, "NO" — otherwise.

Examples

input

Copy

2 2 1
1 2

output

YES

input

Copy

3 4 0

output

NO

input

Copy

100 50 2
50 25
50 25

output

NO

【题意】 有一个n*m的棋盘，上面有k个棋子，先手每次可以移动一个棋子去相邻的格子，如果能够把某个棋子移动到棋盘外面，则先手获胜；后手每次可以封闭一个边界（两个顶点之间的边，封闭后不能从该边移动到边界外面），如果先手不能够把某个棋子移动到棋盘外面，则后手胜；

【思路】分析棋盘可以发现，对于四个角落来说，每个角落都有两条边，也就是说四个角落一共多出四条边，加上原先边界的一条边，则一共5条边，所有当某个棋子距离边界的距离小于5的时候，这五条边一定存在某条边没有被封闭，则先手必胜，否则先手必败。

【代码如下】

#include <bits/stdc++.h>
using namespace std;

int n,m,k;

int main(){
    scanf("%d%d%d",&n,&m,&k);
    int flag = 0;
    for(int i = 1; i <= k; i ++){
        int x,y;
        scanf("%d%d",&x,&y);
        if(x <= 5 || y <= 5 || x >= n-4 || y >= m-4) flag = 1;
    }
    if(flag) printf("YES\n");
    else printf("NO\n");
    return 0;
}