#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const double eps = 1e-9;
const double PI = acos(-1.0);
long long qpow(long long n, long long k) {
  long long ans = 1;
  assert(k >= 0);
  n %= mod;
  while (k > 0) {
    if (k & 1) ans = (ans * n) % mod;
    n = (n * n) % mod;
    k >>= 1;
  }
  return ans % mod;
}
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << fixed << setprecision(10) << x; }
void __print(double x) { cerr << fixed << setprecision(10) << x; }
void __print(long double x) { cerr << fixed << setprecision(10) << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int U, D, L, R;
vector<int> row[100010], col[100010];
long long covered = 0;
void call(int r, int c, int type) {
  if (abs(U - D) <= 1 && abs(L - R) <= 1) return;
  if (type == 1) {
    int pos = upper_bound(row[r].begin(), row[r].end(), c) - row[r].begin();
    pos = row[r][pos];
    R = min(R, pos);
    pos = min(pos - 1, R - 1);
    int add = abs(pos - c);
    if (add == 0) return;
    covered += add;
    U = r;
    call(r, pos, 2);
  } else if (type == 2) {
    int pos = upper_bound(col[c].begin(), col[c].end(), r) - col[c].begin();
    pos = col[c][pos];
    D = min(D, pos);
    pos = min(pos - 1, D - 1);
    int add = abs(pos - r);
    if (add == 0) return;
    covered += add;
    R = c;
    call(pos, c, 3);
  } else if (type == 3) {
    int pos = upper_bound(row[r].begin(), row[r].end(), c) - row[r].begin();
    pos--;
    assert(pos >= 0);
    pos = row[r][pos];
    L = max(L, pos);
    pos = max(pos + 1, L + 1);
    int add = abs(pos - c);
    if (add == 0) return;
    covered += add;
    D = r;
    call(r, pos, 4);
  } else {
    int pos = upper_bound(col[c].begin(), col[c].end(), r) - col[c].begin();
    pos--;
    assert(pos >= 0);
    pos = col[c][pos];
    U = max(U, pos);
    ;
    pos = max(pos + 1, U + 1);
    int add = abs(pos - r);
    if (add == 0) return;
    covered += add;
    L = c;
    call(pos, c, 1);
  }
}
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  U = L = 0;
  D = n + 1, R = m + 1;
  for (int i = 0; i < k; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    row[x].push_back(y);
    col[y].push_back(x);
  }
  for (int i = 0; i <= n; i++) {
    row[i].push_back(-1);
    row[i].push_back(1000000);
    sort(row[i].begin(), row[i].end());
  }
  for (int i = 0; i <= m; i++) {
    col[i].push_back(-1);
    col[i].push_back(1000000);
    sort(col[i].begin(), col[i].end());
  }
  call(1, 1, 2);
  if ((n * 1ll * m - k) == covered + 1) return printf("Yes\n"), 0;
  U = L = 0;
  D = n + 1, R = m + 1;
  covered = 0;
  call(1, 1, 1);
  if ((n * 1ll * m - k) == covered + 1)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
