#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

signed main() {
  int n, m;
  cin >> n >> m;
  int q;
  cin >> q;
  vi a(q);
  rep (i, q) {
    cin >> a[i];
    a[i]--;
  }
  //DEBUG_VEC(a);

  vi pre_idx_value(m, inf);
  vi pre_idx_same_value(q, -1);
  rrep (i, q) {
    if (pre_idx_value[a[i]] != inf) {
      pre_idx_same_value[pre_idx_value[a[i]]] = i;
    }
    pre_idx_value[a[i]] = i;
  }
  
  vector<bool> used_x(m);
  vi pre_idx(n, inf);
  int idx = q - 1;

  int ok_idx = q;
  int nex = 0;
  while (true) {
    bool flag = true;
    for (int i = ok_idx - 1; i >= 0; i--) {
      while (nex < m and used_x[nex]) nex++;
      if (used_x[a[i]]) {
        ok_idx = i;
        continue;
      }
      if (a[i] == nex) {
        nex = a[i] + 1;
        ok_idx = i;
      }
      else if (a[i] < nex) {
        ok_idx = i;
        continue;
      }
      else {
        flag = false;
        break;
      }
    }
    if (flag) {
      cout << "Yes" << endl;
      return 0;
    }
    //DEBUG(pre);
    //DEBUG(idx);
    while (idx >= 0) {
      if (used_x[a[idx]]) idx--;
      else break;
    }
    if (idx == -1) {
      cout << "Yes" << endl;
      return 0;
    }
    //DEBUG(idx);

    used_x[a[idx]] = true;
    pre_idx[0] = idx;
    int j = 1;
    int i = pre_idx_same_value[idx];
    while (i >= 0) {
      if (i < pre_idx[j]) {
        pre_idx[j] = i;
        j++;
      }
      if (j == n) break;
      i = pre_idx_same_value[i];
    }
    if (j < n) {
      cout << "No" << endl;
      return 0;
    }
  }
}


Measured memory_bytes: 3456