#include<cstdio>
#include<algorithm>
#define INF (1 << 30)
#define FOR(i,a,b)\
   for(int i=a; i<=b; ++i)
#define FORR(i,a,b)\
   for(int i=a; i>=b; --i)
#define infile "pod.in"
#define outfile "pod.out"
#define mMax 1005
#define kMax 23
#define MOD 9901
using namespace std;

struct Matrix{
	int M[kMax][kMax];
	int L, C;

    #define A (*this)

	Matrix(){
		FOR(i,0,kMax-1)
		   FOR(j,0,kMax-1)
		      M[i][j] = 0;
	}

	Matrix operator * (const Matrix &B)const{
		Matrix C;

		FOR(i, 1, A.L)
		   FOR(j, 1, B.C)
		      FOR(k, 1, A.C){
		         C.M[i][j] += A.M[i][k] * B.M[k][j];

		         if(C.M[i][j] > MOD)
		        	 C.M[i][j] %= MOD;
		}

		return C;
	}
} I, EXP, DP;

int V[mMax];

int N, M, K, Sol;

void read(){
    freopen(infile, "r", stdin);
    
    scanf("%d %d %d", &N, &M, &K);
    
    FOR(i,1,M)
       scanf("%d", &V[i]);

    fclose(stdin);
}

void pow(int K){
	Matrix M = EXP;

	for (int i = 0; (1 << i) <= K; ++i){
		if ((1 << i) & K)
			DP = DP *  M;

	    M = M * M;
	}
}

void solve(){
    sort(V+1, V+M+1);

    I.L = I.C = K;
    FOR(i,1,K)
       I.M[i][i] = 1;

    EXP.L = EXP.C = K;
    FOR(i,1,K)
        EXP.M[i+1][i] = 1, EXP.M[i][K] = 1;

    DP.L = 1; DP.C = K;
    DP.M[1][K] = 1;

    V[++ M] = N;

    FOR(i,1,M){
        pow(V[i] - V[i - 1]);

        if (i != M)
        	DP.M[1][K] = 0;
    }
    
    Sol = DP.M[1][K];
}

void print(){
    freopen(outfile, "w", stdout);
    
    printf("%d\n", Sol);
    
    fclose(stdout);
}

int main(){
    read();
    solve();
    print();

    return 0;
}