#include <cstdio>
#include <algorithm>
#include <cstring>

#define KMax 22
#define MMax 1005
#define Mod 9901

using namespace std;

int N, K, M[MMax], Z[KMax][KMax], DP[KMax];

void BuildZ ()
{
    Z[1][K]=Z[K][K]=1;
    for (int i=2; i<=K; ++i)
    {
        Z[i][i-1]=1;
    }
}

void InitDP ()
{
    for (int i=1; i<=K; ++i) DP[i]=1;
}

inline void Copy (int A[KMax][KMax], int B[KMax][KMax])
{
    for (int i=1; i<=K; ++i)
    {
        for (int j=1; j<=K; ++j)
        {
            A[i][j]=B[i][j];
        }
    }
}

inline void Multiply (int A[KMax][KMax], int B[KMax][KMax])
{
    int C[KMax][KMax]; memset (C, 0, sizeof (C));
    for (int i=1; i<=K; ++i)
    {
        for (int j=1; j<=K; ++j)
        {
            for (int k=1; k<=K; ++k)
            {
                C[i][j]=(C[i][j]+A[i][k]*B[k][j])%Mod;
            }
        }
    }
    Copy (A, C);
}

inline void Pow (int X[KMax][KMax], int P)
{
    int R[KMax][KMax]; memset (R, 0, sizeof (R));
    for (int i=1; i<=K; ++i) R[i][i]=1;
    while (P>0)
    {
        if (P%2==0)
        {
            Multiply (X, X); P/=2;
        }
        else
        {
            Multiply (R, X); --P;
        }
    }
    Copy (X, R);
}

inline void Compute (int P)
{
    int X[KMax][KMax]; Copy (X, Z);
    Pow (X, P);
    int NewDP[KMax]; memset (NewDP, 0, sizeof (NewDP));
    for (int i=1; i<=K; ++i)
    {
        for (int j=1; j<=K; ++j)
        {
            NewDP[i]=(NewDP[i]+DP[j]*X[j][i])%Mod;
        }
    }
    for (int i=1; i<=K; ++i) DP[i]=NewDP[i];
}

void Solve ()
{
    BuildZ ();
    sort (M+1, M+M[0]+1);
    int P=K;
    for (int i=1; i<=M[0]; ++i)
    {
        Compute (M[i]-P);
        DP[K]=0; P=M[i];
    }
}

void Read ()
{
    freopen ("pod.in", "r", stdin);
    int Broken; scanf ("%d %d %d", &N, &Broken, &K);
    InitDP ();
    for (int i=1; i<=Broken; ++i)
    {
        int P; scanf ("%d", &P); ++P;
        if (P<=K)
        {
            for (int j=P; j<=K; ++j) DP[j]=0;
        }
        else M[++M[0]]=P;
    }
    M[++M[0]]=N+2;
}

void Print ()
{
    freopen ("pod.out", "w", stdout);
    if (N<K) printf ("%d\n", DP[N]);
    else printf ("%d\n", DP[K-1]);
}

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