CF55C.Pie or die

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.

沃洛佳和弗拉德玩如下游戏：在一个 $n \times m$ 的棋盘上共有 $k$ 个派（pie）。每轮中，沃洛佳将其中一个派移动到与其相邻（共享一条边）的格子中。若该派位于棋盘边界上，则沃洛佳可将其移出棋盘，从而获得该派并获胜。在沃洛佳完成移动后，弗拉德会封锁棋盘边界上一条长度为 1 的边（即棋盘网格线上的两个相邻格点之间的边），使得沃洛佳此后无法再通过该边将派移出棋盘。问题是：沃洛佳能否赢得此游戏？我们假设双方均采取最优策略。

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.

第一行包含 3 个整数，以空格分隔：$1 \leq n, m \leq 100$ —— 棋盘的尺寸，以及 $0 \leq k \leq 100$ —— 派（pie）的数量。接下来的 $k$ 行中，每行包含 2 个整数，以空格分隔：$1 \leq x \leq n$, $1 \leq y \leq m$ —— 对应派的坐标。一个格子中可能有多个派。

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

输出一个单词：“YES”（如果沃洛佳获胜），“NO”（否则）。