#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const int N = 1e5 + 7;
int n, m, K;
long long ans;
vector<int> X[N], Y[N];
int main() {
  n = read(), m = read(), K = read();
  for (int i = 1; i <= K; i++) {
    int a = read(), b = read();
    X[a].push_back(b);
    Y[b].push_back(a);
  }
  for (int i = 1; i <= n; i++) sort(X[i].begin(), X[i].end());
  for (int i = 1; i <= m; i++) sort(Y[i].begin(), Y[i].end());
  int x = 1, y = 1, k = 1, flag = 0;
  ans++;
  int xL = 0, xR = n + 1, yL = 0, yR = m + 1;
  while (233) {
    int tx = 0, ty = 0;
    if (k == 1) {
      tx = x, ty = lower_bound(X[x].begin(), X[x].end(), y) - X[x].begin();
      if (ty == X[x].size())
        ty = yR - 1;
      else
        ty = min(yR - 1, X[x][ty] - 1);
      k = 2;
      xL = x;
    } else if (k == 2) {
      tx = lower_bound(Y[y].begin(), Y[y].end(), x) - Y[y].begin(), ty = y;
      if (tx == Y[y].size())
        tx = xR - 1;
      else
        tx = min(xR - 1, Y[y][tx] - 1);
      k = 3;
      yR = y;
    } else if (k == 3) {
      tx = x, ty = lower_bound(X[x].begin(), X[x].end(), y) - X[x].begin() - 1;
      if (ty < 0)
        ty = yL + 1;
      else
        ty = max(yL + 1, X[x][ty] + 1);
      k = 4;
      xR = x;
    } else if (k == 4) {
      tx = lower_bound(Y[y].begin(), Y[y].end(), x) - Y[y].begin() - 1, ty = y;
      if (tx < 0)
        tx = xL + 1;
      else
        tx = max(xL + 1, Y[y][tx] + 1);
      k = 1;
      yL = y;
    }
    if (x == tx && y == ty && flag) break;
    ans += abs(x - tx) + abs(y - ty);
    x = tx, y = ty;
    flag = 1;
  }
  if (ans > 1ll * n * m - K) cout << "GG";
  if (ans == 1ll * n * m - K)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
