#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)

int L,N,M;
vector<int> K,p;
int ans=0;

void f(int ind){
	if(ind!=L){
		rep(i,N){
			p[ind]=i+1;
			f(ind+1);
		}
	}else{
		rep(j,M){
			int tmp=0;
			rep(i,L){
				if(p[i]==K[j]) tmp++;
				else if(tmp==K[j]) break;
				else tmp=0;
			}
			if(tmp==K[j]){
				ans++;
				break;
			}
		}
	}
	return ;
}

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	cin>>L>>N>>M;
	p.resize(L);
	K.resize(M);
	rep(i,M) cin>>K[i];
	assert(L<=1000);
	if(M==0){
		cout<<"0\n";
		return 0;
	}
	f(0);
	cout<<ans<<"\n";
}