#include<cstdio>
#include<bitset>
#define mod 9901
using namespace std;

int i,j,n,k,a[2000000],m;

bitset<2000000> fol;

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

    scanf("%d%d%d",&n,&m,&k);

    for(i=1;i<=m;++i)
    {
        scanf("%d",&j);
        fol[j]=1;
    }
    a[0]=1;

    for(i=1;i<=n;++i)
    if(!fol[i])
    {
        a[i]=a[i-1];
        if(i-k>=0&&k>1) a[i]+=a[i-k];
        if(a[i]>mod) a[i]%=mod;
    }

    printf("%d\n",a[n]);

    fclose(stdin);
    fclose(stdout);

    return 0;
}