/*
Author: QAQAutomaton
Lang: C++
Code: F.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> cp;
typedef pair<int,int> pii;
int inf;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T,class T2>int chkmin(T &a,T2 b){return a>b?a=b,1:0;}
template<class T,class T2>int chkmax(T &a,T2 b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T,class T2>T mmin(T a,T2 b){return a<b?a:b;}
template<class T,class T2>T mmax(T a,T2 b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__{
	__INIT__(){
		memset(&inf,0x3f,sizeof(inf));
		fill((unsigned char*)&inf,(unsigned char*)&inf+sizeof(inf),0x3f);
	}
}__INIT___;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	template<typename A>
	inline bool read (A &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		while((x=gc())==' '||x=='\n' || x=='\r');
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r');
		if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'||*x==EOF))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	template<typename A>
	inline bool write (A x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
const int p=1000000007;
struct Z{
	uint x;
	Z(){}
	Z(uint a){
		x=a;
	}
};
inline uint modp(const uint x){
	return x<p?x:x-p;
}
inline Z operator+(const Z x1, const Z x2) { return modp(x1.x+x2.x);}
inline Z operator-(const Z x1, const Z x2) { return modp(x1.x+p-x2.x);}
inline Z operator-(const Z x) {return x.x?p-x.x:0;}
inline Z operator*(const Z x1, const Z x2) { return static_cast<ull>(x1.x)*x2.x%p;}
void exgcd(int a,int b,int &x,int &y){
	if(!b){x=1;y=0;return;}
	exgcd(b,a%b,y,x);
	y-=(a/b)*x;
}
inline Z Inv(const Z a){
	int x,y;
	exgcd(p,a.x,x,y);
	return y<0?y+=p:y;
}
inline Z operator/(const Z x1, const Z x2) { return x1*Inv(x2);}

inline Z &operator++(Z &x1){x1.x==p-1?x1.x=0:++x1.x;return x1;} 
inline Z &operator--(Z &x1){x1.x?--x1.x:x1.x=p-1;return x1;}
inline Z &operator+=(Z &x1, const Z x2) { return x1 = x1 + x2; }
inline Z &operator-=(Z &x1, const Z x2) { return x1 = x1 - x2; }
inline Z &operator*=(Z &x1, const Z x2) { return x1 = x1 * x2; }
inline Z &operator/=(Z &x1, const Z x2) { return x1 = x1 / x2; }
inline Z fpm(Z a,int b){Z c(1);for(;b;b>>=1,a*=a)if(b&1)c*=a;return c;}
int las[405];
int a[25005];
int n,k,m;	
namespace case1{
	int main(){
		return write((fpm(k,n-m)*(n-m+1)).x,'\n');
	}
}
namespace case2{
	typedef pair<Z,Z> pz;
	inline pz operator +(const pz a,const pz b){return make_pair(a.x+b.x,a.y+b.y);}
	inline pz operator *(const pz a,const int b){return make_pair(a.x*b,a.y*b);}
	inline pz &operator +=(pz &a,const pz b){return a=a+b;}
	pz f[25005][405];
	Z fac[405],invf[405],inv[405];
	int main(){
		fac[0]=fac[1]=inv[1]=invf[0]=invf[1]=1;
		for(int i=2;i<=k;++i){
			fac[i]=fac[i-1]*i;
			inv[i]=(p-p/i)*inv[p%i];
			invf[i]=inv[i]*invf[i-1];
		}
		Z ans(0);
		f[1][1].x=k;
		f[1][1].y=m==1?k:0;
		for(int i=1;i<n;++i){
			for(int j=1;j<k;++j)f[i+1][j]=f[i][j];
			for(int j=k;j;--j)f[i+1][j]+=f[i+1][j+1];
			for(int j=1;j<k;++j)f[i+1][j+1]+=f[i][j]*(k-j);
			for(int j=m;j<k;++j)f[i+1][j].y+=f[i+1][j].x;
		}
		for(int i=1;i<k;++i)ans+=f[n][i].y;
		ans/=fac[k]*invf[k-m];
		ans=fpm(k,n-m)*(n-m+1)-ans;
		return write(ans.x,'\n');
	}
}
namespace case3{
	Z f[25005][405],s[405];
	int main(int x2){
		for(int i=1;i<k;++i)f[0][i]=1;
		for(int i=1;i<=n;++i){
			for(int j=1;j<=k;++j)s[j]=s[j-1]+f[i-1][j];
			for(int j=1;j<k;++j){
				f[i][j]=s[j]+f[i-1][j+1]*(k-j);
			}
		}
		for(int i=1;i<=k;++i)las[i]=0;
		int x1=0;
		for(int i=1;i<=m;++i){
			if(las[a[i]]){x1=i-1;break;}
			las[a[i]]=1;
		}
		Z ans(0);
		for(int i=0;i+m<=n;++i)ans+=f[i][x1]*f[n-i-m][x2];
		ans=fpm(k,n-m)*(n-m+1)-ans;
		return write(ans.x,'\n');
	}
}
signed main(){
#ifdef QAQAutoMaton 
	freopen("F.in","r",stdin);
	freopen("F.out","w",stdout);
#endif
	read(n,k,m);
	int mx=0;
	for(int i=1;i<=m;++i){
		read(a[i]);
		chkmax(mx,las[a[i]]);
		if(mx==i-k){
			return case1::main();
		}
		las[a[i]]=i;
	}
	if(!mx){
		case2::main();
	}
	else case3::main(m-mx);
	return 0;
}



Measured memory_bytes: 82672