#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
vector<int> X[100010], Y[100010];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  int n, m, K;
  cin >> n >> m >> K;
  for (int i = 0; i < K; i++) {
    int x, y;
    cin >> x >> y;
    X[x].push_back(y);
    Y[y].push_back(x);
  }
  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 k = 1, tx, ty, x = 1, y = 1;
  int flag = 0;
  int xL = 0, xR = n + 1, yL = 0, yR = m + 1;
  long long ans = 1;
  while (1) {
    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) {
      ty = y, tx = lower_bound(Y[y].begin(), Y[y].end(), x) - Y[y].begin();
      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) {
      ty = y, tx = lower_bound(Y[y].begin(), Y[y].end(), x) - Y[y].begin() - 1;
      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(tx - x) + abs(ty - y);
    x = tx, y = ty;
    flag = 1;
  }
  if (ans == 1ll * n * m - K)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
