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

//retrun x^{y}
ll my_pow(ll x,ll y){
	if(x==0) return 0;
	if(y==0) return 1;
	if(y%2) return (x*my_pow(x,y-1))%mod;
	return my_pow((x*x)%mod,y/2);
}

vector<vector<ll>> v_mul(vector<vector<ll>> a,vector<vector<ll>> b){
  int A=a.size(),B=a[0].size(),C=b.size(),D=b[0].size();
  vector<vector<ll>> r(A,vector<ll>(D));
  for(int i=0;i<A;i++){
    for(int k=0;k<B;k++){
      for(int j=0;j<D;j++){
        r[i][j]+=(a[i][k]*b[k][j])%mod;
		r[i][j]%=mod;
      }
    }
  }
  return r;
}
vector<vector<ll>> v_jyo(vector<vector<ll>> a,int64_t N){
  int m=a.size();
  ll H=1;
  vector<vector<ll>> r(m,vector<ll>(m,0));
  for(int i=0;i<m;i++){
    r[i][i]=1;
  }
  while(N>0){
    H*=2;
    if(N%H){
      N-=(H/2);
      r=v_mul(r,a);
    }
    a=v_mul(a,a);
  }
  return r;
}

ll MAX_L=1e18;
int MAX_N=15;

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll L,N,M;
	cin>>L>>N>>M;
	vector<int> p(M);
	set<int> s;
	int len=0;
	rep(i,M){
		cin>>p[i];
		len+=p[i]+1;
	}

	sort(p.begin(),p.end());
	assert(1<=L&&L<=MAX_L);
	assert(1<=N&&0<=M&&M<=N&&N<=MAX_N);
	rep(i,M-1) assert(p[i]!=p[i+1]);

	len++;
	vector<vector<ll>> base(len,vector<ll>(len));
	int tmp=0;
	for(auto x:p){
		rep(i,len){
			if(i<tmp||tmp+x+1<=i) base[i][tmp]=1;
		}
		rep(i,x) base[tmp][tmp+1]=1,tmp++;
		s.insert(tmp-1);
		base[tmp][tmp]=1;
		tmp++;
	}
	rep(i,len) base[i][tmp]=N-M;
	tmp=0;
	for(auto x:p){
		rep(i,len){
			if(i!=x+tmp) base[tmp+x-1][i]=0;
		}
		tmp+=x+1;
	}
	auto val=v_jyo(base,L);
	ll ans=my_pow(N,L);
	rep(i,len){
		if(!s.count(i)) ans-=val[len-1][i];
	}
	cout<<(ans%mod+mod)%mod<<"\n";
}