/*
    _____
  .'     '.
 /  0   0  \
|     ^     |
|  \     /  |
 \  '---'  /
  '._____.'
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

struct chash
{
	int operator()(int x) const
	{
		x ^= (x >> 20) ^ (x >> 12);
		return x ^ (x >> 7) ^ (x >> 4);
	}
};

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using hashtable = gp_hash_table<T, U, chash>;
random_device(rd);
mt19937 rng(rd());

template<class T>
void readi(T &x)
{
	T input = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		input = input * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		input = -input;
	}
	x = input;
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int aout[20];
	int ilen = 0;
	while(output)
	{
		aout[ilen] = ((output % 10));
		output /= 10;
		ilen++;
	}
	for (int i = ilen - 1; i >= 0; i--)
	{
		putchar(aout[i] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
template<class T, class U>
T nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define debug(x) cerr << #x << " = " << x << endl;

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-10;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 25013
#define MAXK 413

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;

int N, M, K;
int arr[MAXN];
ll ans;
ll tot;
int seen[MAXN];
ll dp[2][MAXN][MAXK], pref[2][MAXN][MAXK];
int lt, rt;

ll expo(ll a, ll e)
{
	if (e == 0)
	{
		return 1;
	}
	ll was = expo(a, e / 2);
	if (e % 2)
	{
		return was * was % INF * a % INF;
	}
	return was * was % INF;
}

void solve()
{
	if (lt == M)
	{
		//u want to count the # of times an M-block appears in all bad N guys
		//how many ways are there to finish given that ur at x and there are y left
		for (int j = 1; j < K; j++)
		{
			dp[0][0][j]++;
			pref[0][0][j + 1] = pref[0][0][j] + dp[0][0][j];
		}
		for (int i = 1; i <= N; i++)
		{
			for (int j = 1; j < K; j++)
			{
				dp[0][i][j] = (K - j) * (dp[0][i - 1][j + 1]) + (pref[0][i - 1][j + 1]);
				dp[0][i][j] %= INF; dp[0][i][j] += INF; nmod(dp[0][i][j], INF);
				pref[0][i][j + 1] = pref[0][i][j] + dp[0][i][j]; nmod(pref[0][i][j + 1], INF);
			}
		}
		dp[1][0][0]++;
		for (int j = 1; j <= K; j++)
		{
			pref[1][0][j]++;
		}
		for (int i = 1; i <= N; i++)
		{
			for (int j = 1; j < K; j++)
			{
				dp[1][i][j] = dp[1][i - 1][j - 1] * (K - j + 1) + (pref[1][i - 1][K] - pref[1][i - 1][j]);
				dp[1][i][j] %= INF; dp[1][i][j] += INF; nmod(dp[1][i][j], INF);
				pref[1][i][j + 1] = pref[1][i][j] + dp[1][i][j]; nmod(pref[1][i][j + 1], INF);
				if (j >= M)
				{
					ans += dp[1][i][j] * dp[0][N - i][j] % INF;
					nmod(ans, INF);
				}
			}
		}
		ll factor = 1;
		for (int i = K - M + 1; i <= K; i++)
		{
			factor *= i; factor %= INF;
		}
		ans *= expo(factor, INF - 2); ans %= INF;
		//K*(K-1)...(K-M+1)
	}
	else
	{
		dp[0][0][lt] = 1;
		for (int j = lt + 1; j <= K; j++)
		{
			pref[0][0][j] = 1;
		}
		for (int i = 1; i <= N; i++)
		{
			for (int j = 1; j < K; j++)
			{
				//if j = 1, it's K
				dp[0][i][j] = (K - j + 1) * dp[0][i - 1][j - 1] + (pref[0][i - 1][K] - pref[0][i - 1][j]);
				dp[0][i][j] %= INF; dp[0][i][j] += INF; nmod(dp[0][i][j], INF);
				pref[0][i][j + 1] = pref[0][i][j] + dp[0][i][j]; nmod(pref[0][i][j + 1], INF);
			}
		}
		dp[1][0][rt] = 1;
		for (int j = rt + 1; j <= K; j++)
		{
			pref[1][0][j] = 1;
		}
		for (int i = 1; i <= N; i++)
		{
			for (int j = 1; j < K; j++)
			{
				//anything from j....K-1
				dp[1][i][j] = (K - j + 1) * dp[1][i - 1][j - 1] + (pref[1][i - 1][K] - pref[1][i - 1][j]);
				dp[1][i][j] %= INF; dp[1][i][j] += INF; nmod(dp[1][i][j], INF);
				pref[1][i][j + 1] = pref[1][i][j] + dp[1][i][j]; nmod(pref[1][i][j + 1], INF);
			}
		}
		for (int i = 0; i <= N - M; i++)
		{
			// cerr << pref[0][i][K] << ' ' << pref[1][N - (i + M)][K] << endl;
			ans += (pref[0][i][K] * pref[1][N - (i + M)][K]) % INF;
			nmod(ans, INF);
		}
		// cerr << lt << ' ' << rt << endl;
		return;
	}
}

int32_t main()
{
	ios_base::sync_with_stdio(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// freopen ("file.in", "r", stdin);
	// freopen ("file.out", "w", stdout);
	cin >> N >> K >> M;
	for (int i = 0; i < M; i++)
	{
		cin >> arr[i];
		arr[i]--;
	}
	//(N-M+1)*K^(N-M)
	//u need to avoid permutations of (1...K)
	for (lt = 0; lt < M; lt++)
	{
		if (seen[arr[lt]])
		{
			break;
		}
		seen[arr[lt]]++;
	}
	for (int i = 0; i < K; i++)
	{
		seen[i] = 0;
	}
	for (rt = 0; rt < M; rt++)
	{
		if (seen[arr[M - 1 - rt]])
		{
			break;
		}
		seen[arr[M - 1 - rt]]++;
	}
	for (int i = 0; i < K; i++)
	{
		seen[i] = 0;
	}
	solve();
	lt = 0; rt = 0;
	for (int i = 0; i < K - 1; i++)
	{
		if (!seen[arr[i]]) lt++;
		seen[arr[i]]++;
	}
	for (int i = K - 1; i < M; i++)
	{
		if (!seen[arr[i]]) lt++;
		seen[arr[i]]++;
		ckmax(rt, lt);
		seen[arr[i - K + 1]]--;
		if (!seen[arr[i - K + 1]]) lt--;
	}
	// cerr << rt << endl;
	if (rt == K)
	{
		ans = 0;
		// cerr << "rekt\n";
	}
	tot = N - M + 1;
	for (int i = 0; i < N - M; i++)
	{
		tot *= K;
		tot %= INF;
	}
	ans = tot - ans;
	ans += INF;
	nmod(ans, INF);
	cout << ans << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}


Measured memory_bytes: 323200