#include <iostream>
#include <fstream>
#include <cstdio>
#include <algorithm>
using namespace std;
ofstream g("pod.out");
int a[1001],b[21],i,m,n,k,x,ok;
int main()
{
    freopen ("pod.in","r",stdin);
    scanf("%d%d%d",&n,&m,&k);
    for(i=1;i<=m;i++)
    {
        scanf("%d",&x);
        a[i]=x;
    }
    sort(a+1,a+m+1);
    x=1;
    ok=0;
    for(i=1;i<=k-1;i++)
    {
        if(i==a[x])
        {
            x++;
            b[i]=0;
            ok=1;
        }
        else
        {
            if(ok==1)
                b[i]=0;
            else b[i]=1;
        }
    }
    b[k]=b[k-1]+1;
    for(i=k+1;i<=n;i++)
    {
        if(i==a[x])
        {
            b[i%20]=0;
            x++;
        }
        else b[i%20]=(b[(i-1)%20]+b[(i-k)%20])%9901;
    }
    g<<b[n%20];
    return 0;
}