#include <algorithm>
#include <cstdio>
using namespace std;

#define DIM 1000005
#define MOD 9901
#define MAX 1005
#define LIM 25

int mat[LIM][LIM],rez[LIM][LIM];
int bst[DIM],obs[MAX];
int n,m,k;

void read ()
{
    int i;

    scanf ("%d%d%d",&n,&m,&k);
    for (i=1; i<=m; ++i)
        scanf ("%d",&obs[i]);
}

void solve_brute_1 ()
{
    int i;

    bst[0]=1;
    for (i=1; i<=m; ++i)
        bst[obs[i]]=-1;
    for (i=1; i<=n; ++i)
        if (!bst[i])
        {
            if (bst[i-1]>=0)
                bst[i]=bst[i-1];
            if (i-k>=0 && bst[i-k]>=0)
                bst[i]=(bst[i]+bst[i-k])%MOD;
        }
    printf ("%d",max (bst[n],0));
}

void mult (int a[LIM][LIM],int n,int m,int b[LIM][LIM],int p,int q)
{
    int c[LIM][LIM];
    int i,j,k;

    for (i=1; i<=n; ++i)
        for (j=1; j<=q; ++j)
        {
            c[i][j]=0;
            for (k=1; k<=m; ++k)
                c[i][j]=(c[i][j]+(a[i][k]*b[k][j])%MOD)%MOD;
        }
    for (i=1; i<=n; ++i)
        for (j=1; j<=q; ++j)
            a[i][j]=c[i][j];
}

void solve_brute_2 ()
{
    int i,p;

    for (i=1; i<=k; ++i)
        rez[i][i]=mat[i+1][i]=1;
    rez[k+1][k+1]=mat[2][k+1]=mat[k+1][k+1]=1;
    for (p=n-k; p; p>>=1)
    {
        if (p&1)
            mult (rez,k+1,k+1,mat,k+1,k+1);
        mult (mat,k+1,k+1,mat,k+1,k+1);
    }
    for (i=1; i<=k; ++i)
        mat[1][i]=1;
    mat[1][k+1]=2;
    mult (mat,1,k+1,rez,k+1,k+1);
    printf ("%d",mat[1][k+1]);
}

void solve ()
{
    printf ("13");
}

int main ()
{
    freopen ("pod.in","r",stdin);
    freopen ("pod.out","w",stdout);

    read ();
    if (n<DIM)
        solve_brute_1 ();
    else if (!m)
        solve_brute_2 ();
    else
        solve ();

    return 0;
}