#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
vector<int> row[N];
vector<int> col[N];
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  int x, y, pos;
  for (int i = 1; i <= k; i++) {
    scanf("%d%d", &x, &y);
    row[x].push_back(y);
    col[y].push_back(x);
  }
  for (int j = 1; j <= m; j++) {
    col[j].push_back(0);
    col[j].push_back(n + 1);
  }
  for (int i = 1; i <= n; i++) {
    row[i].push_back(0);
    row[i].push_back(m + 1);
  }
  for (int i = 1; i <= n; i++) {
    sort(row[i].begin(), row[i].end());
  }
  for (int j = 1; j <= m; j++) {
    sort(col[j].begin(), col[j].end());
  }
  int left, right, up, down;
  x = 1;
  y = 1;
  left = 0;
  right = m + 1;
  up = 1;
  down = n + 1;
  long long cnt = 1;
  int dir = 0;
  bool firstTime = true;
  while (true) {
    if (dir == 0) {
      int pos = *upper_bound(row[x].begin(), row[x].end(), y) - 1;
      if (pos >= right) {
        pos = right - 1;
      }
      if (pos == y && !firstTime) {
        break;
      }
      cnt += pos - y;
      y = pos;
      right = pos;
      firstTime = false;
    } else if (dir == 1) {
      pos = *upper_bound(col[y].begin(), col[y].end(), x) - 1;
      if (pos >= down) {
        pos = down - 1;
      }
      if (pos == x) {
        break;
      }
      cnt += pos - x;
      x = pos;
      down = x;
    } else if (dir == 2) {
      pos = *upper_bound(row[x].rbegin(), row[x].rend(), y, greater<int>()) + 1;
      if (pos <= left) {
        pos = left + 1;
      }
      if (pos == y) {
        break;
      }
      cnt += y - pos;
      y = pos;
      left = y;
    } else {
      pos = *upper_bound(col[y].rbegin(), col[y].rend(), x, greater<int>()) + 1;
      if (pos <= up) {
        pos = up + 1;
      }
      if (pos == x) {
        break;
      }
      cnt += x - pos;
      x = pos;
      up = x;
    }
    dir = (dir + 1) % 4;
  }
  if (cnt + k == (long long)n * m) {
    printf("Yes\n");
  } else {
    printf("No\n");
  }
  return 0;
}
