#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)


#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include<cmath>



//#define ATCODER

#ifdef ATCODER
	#include<atcoder/all>
	using namespace atcoder;
#endif


using namespace std;



#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
using ll = long long;
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
//using ll = __int128_t;
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 300010;
const double pi = acos(-1);
constexpr double EPS = 1e-8;

constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void Yes(bool cond) { cout << (cond ? "Yes" : "No") << '\n'; }
void YES(bool cond) { cout << (cond ? "YES" : "NO") << '\n'; }
using ld = long double;



int cnt[100010];
int ord[100010];//ord[i]=初登場がi番目の要素
int rev[100010];//rev[i]=要素iの初登場順
void solve() {
	int N, M;
	cin >> M >> N;
	int Q;
	cin >> Q;
	vector<int>A(Q);
	REP(i, Q) {
		cin >> A[i];
		A[i]--;
	}
	int idx = 0;
	vector<bool>used(N);
	REPR(i, Q) {
		int v = A[i];
		if (used[v])continue;
		ord[idx] = v;
		rev[v] = idx;
		idx++;
		used[v] = true;
	}
	REP(i, N) {
		int v = i;
		if (used[v])continue;
		ord[idx] = v;
		rev[v] = idx;
		idx++;
		used[v] = true;
	}
	REPR(i, Q) {
		int v = A[i];
		int id = rev[v];
		if (id == 0) {
			if (cnt[v] == M)continue;
			else cnt[v]++;
		}
		else {
			int pre = ord[id - 1];
			if (cnt[v] < cnt[pre])cnt[v]++;
		}
	}
	//REP(i, N) {
	//	DEBUG(i);
	//	DEBUG(rev[i]);
	//	DEBUG(cnt[i]);
	//}
	REP(i, N) {
		int v = i;
		int id = rev[v];
		if (id == 0) {
			if (cnt[v] == M)continue;
			else cnt[v] = M;
		}
		else {
			int pre = ord[id - 1];
			if (cnt[pre]==M)cnt[v]=M;
		}
	}
	bool ok = true;
	REP(i, N)if (cnt[i] != M)ok = false;

	Yes(ok);
}





signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	//while (true)test();
	solve();

}


Measured memory_bytes: 6408