#include <cstring>
#include <fstream>
#include <algorithm>

using namespace std;

const int MOD = 9901;

int N, M, K;
int Val[1002];
int now[20][20], todo[20][20];

int M1[20][20], M2[20][20], M3[20][20];
long long auxres[20][20];

void inm(int A[][20], int B[][20])
{
	for (int i = 0; i < K; ++i)
		for (int j = 0; j < K; ++j)
		{
			auxres[i][j] = 0;
			for (int k = 0; k < K; ++k)
				auxres[i][j] += 1LL * A[i][k] * B[k][j];
		}
	for (int i = 0; i < K; ++i)
		for (int j = 0; j < K; ++j)
		{
			if (auxres[i][j] >= MOD) auxres[i][j] %= MOD;
			A[i][j] = auxres[i][j];
		}
}
void power(int (*A)[20], int B)
{
	memcpy(M1, A, sizeof(M1));
	memset(M2, 0, sizeof(M2));
	for (int i = 0; i < K; ++i)
		M2[i][i] = 1;
	
	for (int i = 0; (1 << i) <= B; ++i)
	{
		if ((1 << i) & B)
			inm(M2, M1);
		inm(M1, M1);
	}
}

int main()
{
	ifstream fin("pod.in");
	ofstream fout("pod.out");
	
	fin >> N >> M >> K;
	for (int i = 1; i <= M; ++i)
		fin >> Val[i];
	sort(Val + 1, Val + M + 1);
	
	if (Val[M] == N)
	{
		fout << 0 << '\n';
		fin.close();
		fout.close();
		return 0;
	}
	
	++M, Val[M] = N;
	
	now[0][K - 1] = 1;
	
	for (int i = 1; i <= K - 1; ++i)
		todo[i][i - 1] = 1;
	todo[K - 1][K - 1] = 1;
	todo[0][K - 1] = 1;
	
	for (int i = 1; i <= M; ++i)
	{
		power(todo, Val[i] - Val[i - 1]);
		inm(now, M2);
		if (i != M) now[0][K - 1] = 0;
	}
	
	fout << now[0][K - 1] << '\n';
	
	fin.close();
	fout.close();
}