#include <bits/stdc++.h>
using namespace std;
int minx[100010];
int maxx[100010];
int miny[100010];
int maxy[100010];
set<int> sx[100010], sy[100010];
void solve(int qq) {
  long long n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < 100010; i++) {
    minx[i] = m + 1;
    miny[i] = n + 1;
    maxx[i] = 0;
    maxy[i] = 0;
    sx[i].insert(0);
    sx[i].insert(m + 1);
    sy[i].insert(0);
    sy[i].insert(n + 1);
  }
  for (int i = 0; i < k; i++) {
    int x, y;
    cin >> x >> y;
    maxx[x] = max(maxx[x], y);
    minx[x] = min(minx[x], y);
    maxy[y] = max(maxy[y], x);
    miny[y] = min(miny[y], x);
    sx[x].insert(y);
    sy[y].insert(x);
  }
  int cx = 1, cy = 1;
  int cur = 1;
  int xlb = 0;
  int ylb = 0;
  int xub = n + 1;
  int yub = m + 1;
  long long visited = 1;
  while (true) {
    if (cur == 1) {
      set<int>::iterator it = sx[cx].lower_bound(cy);
      int new_cy = min(*it, yub) - 1;
      visited += abs(new_cy - cy);
      xlb = cx;
      if (new_cy == cy and (cx != 1 or cy != 1)) break;
      cy = new_cy;
      cur = 2;
    } else if (cur == 2) {
      set<int>::iterator it = sy[cy].lower_bound(cx);
      int new_cx = min(*it, xub) - 1;
      visited += abs(new_cx - cx);
      yub = cy;
      if (new_cx == cx) break;
      cx = new_cx;
      cur = 3;
    } else if (cur == 3) {
      set<int>::iterator it = sx[cx].lower_bound(cy);
      it--;
      int new_cy = max(*it, ylb) + 1;
      visited += abs(new_cy - cy);
      xub = cx;
      if (new_cy == cy) break;
      cy = new_cy;
      cur = 4;
    } else if (cur == 4) {
      set<int>::iterator it = sy[cy].lower_bound(cx);
      it--;
      int new_cx = max(*it, xlb) + 1;
      visited += abs(new_cx - cx);
      ylb = cy;
      if (new_cx == cx) break;
      cx = new_cx;
      cur = 1;
    }
  }
  if (1ll * n * m - k == visited) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  int t;
  t = 1;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}
