#include <bits/stdc++.h>

using namespace std;

const int MOD = 9901;

int N, M, K;
int s[10005];
int sol[25][25], a[25][25], b[25][25], z[25][25];

inline void Read()
{
    ifstream f("pod.in");
    f >> N >> M >> K;
    for(int i = 1; i <= M; i++)
        f >> s[i];
    f.close();
}

inline void Cappy(int a[25][25], int b[25][25])
{
    for(int i = 1; i <= K; i++)
        for(int j = 1; j <= K; j++)
            a[i][j] = b[i][j];
}

inline void Init(int a[25][25])
{
    Cappy(a, z);
    for(int i = 1; i < K; i++)
        a[i + 1][i] = 1;
    a[1][K] = 1;
    a[K][K] = 1;

}

inline void Mult_Mat(int a[25][25], int b[25][25])
{
    int i, j , k, val;
    int aux[25][25];
    Cappy(aux, z);
    for(i = 1; i <= K; i++)
        for(j = 1; j <= K; j++)
        {
            val = 0;
            for(k = 1; k <= K; k++)
                val = (val + a[i][k] * b[k][j]) % MOD;
            aux[i][j] = val;
        }
    Cappy(a, aux);
}

inline void Lg_Put(int a[25][25], int p)
{
    int aux[25][25];
    Cappy(aux, z);
    for(int i = 1; i <= K; i++)
        aux[i][i] = 1;
    while(p)
    {
        if(p & 1)
        {
            p--;
            Mult_Mat(aux, a);
        }
        p /= 2;
        Mult_Mat(a, a);
    }
    Mult_Mat(sol, aux);
}

inline void Solve()
{
    sort(s + 1, s + M +1);
    s[++M] = N + 1;
    int i;
    for(i = 1; i < K; i++)
        b[i + 1][i] = 1;
    for(i = 1; i <= K; i++)
        sol[i][i] = 1;
    for(i = 1; i <= M; i++)
    {
        Init(a);
        Lg_Put(a, s[i] - s[i - 1] - 1);
        if(i < M) Mult_Mat(sol, b);
    }
}

inline void Write()
{
    ofstream g("pod.out");
    g << sol[K][K] << "\n";
    g.close();
}

int main()
{
    Read();
    Solve();
    Write();
    return 0;
}