using namespace std;

#include<iostream>
#include<fstream>
#include<bitset>
#define MOD 9901
bitset<10000005> hash;
short dp[10000005];
int M,N,K;
ofstream fout("pod.out");
void solve()
{int i;
    dp[0]=1;
    for(i=1;i<=N;i++)
    {if(hash[i]==1) dp[i]=0;
    else
     {  dp[i]=dp[i-1]%9901;
       if(i-K>=0)
       dp[i]+=dp[i-K];
       dp[i]%=9901;
    }
    }
    fout<<dp[N]<<"\n";
}
void cit()
{int x,i;
    ifstream fin("pod.in");
    fin>>N>>M>>K;
    for(i=0;i<=N;i++)
     hash[i]=0;
    for(i=1;i<=M;i++)
      {fin>>x;
      hash[x]=1;
      }
    fin.close();
}

int main()
{int x,i;
    cit();

    solve();
    fout.close();
    return 0;
}