#include<bits/stdc++.h>
using namespace std;
ifstream fin("pod.in");
ofstream fout("pod.out");

const long long MOD=9901;

long long n,m,k,dp[1000005],w[1000005],impossible[1000005];

int main()
{
    fin>>n>>m>>k;
    for(int i=1; i<=m; i++)
    {
       fin>>impossible[i];
        w[impossible[i]]=1;
    }
    for(int i=1;i<=n;i++)
        if(w[i]==1)
          w[i]=0;
          else
            w[i]=1;
    dp[0]=1;
    w[0]=1;
    for(int i=1; i<=n; i++)
    {
        if(i<k)
        {
            if(w[i]==1)
                dp[i]=1;
        }
        else
        {
           dp[i]=dp[i-1]*w[i-1]+dp[i-k]*w[i-k];
           dp[i]=dp[i]%MOD;
        }
    }
    fout<<dp[n];
    return 0;
}