#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 2e9;
const long long INF64 = 1e18;
const long double EPS = 1e-12;
const long double PI = 3.1415926535897932384626433832795028841;
const long long MD = 925262732;
const long long T = 634521;
const int N = 200010;
const int M = 100;
int n, m, k;
vector<int> a[3000001];
int main() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  ;
  cin >> n >> m >> k;
  for (int u = 0; u < int(k); u++) {
    int first, second;
    cin >> first >> second;
    if (first <= 3000000) a[first].push_back(second);
    for (int i = -1; i <= 1; i++)
      for (int j = -1; j <= 1; j++)
        if (abs(i) + abs(j) == 1 && first + i > 0 && first + i <= 15000 &&
            second + j > 0 && second + j <= 15000 && first + i <= 3000000)
          a[first + i].push_back(second + j);
  }
  bool f = 1;
  if (n > 3000000)
    f = 0;
  else {
    for (int i = 1; i <= n; i++) {
      sort((a[i]).begin(), (a[i]).end());
      int t = 0;
      for (int j = 0; j < int(int((a[i]).size())); j++) {
        if (a[i][j] == t)
          continue;
        else {
          if (a[i][j] == t + 1)
            t++;
          else {
            f = 0;
            break;
          }
        }
        if (t == m) break;
      }
      if (t != m) f = 0;
    }
  }
  if (f)
    cout << "Yes";
  else
    cout << "No";
  return 0;
}
