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

#define Mmax 1010
#define Nmax 1000010
#define MOD 9901

int n, m, k, i;
int v[Mmax], a[Nmax];

void citire () {
	
	scanf ("%d %d %d", &n, &m, &k);
	for (i = 1; i <= m; i++) 
		scanf ("%d", &v[i]);
	
	sort (v + 1, v + m + 1);
}

void brute1 () {

	a[0] = 1; int p = 1;
	for (i = 1; i <= n; i++) {
		while (p <= m && v[p] < i) p++;
		
		if (v[p] != i) {
			a[i] = a[i-1];
			if (i - k >= 0) {
				a[i]+= a[i - k];
				if (a[i] >= MOD) a[i]-= MOD;
			}
		}
	}
	
	printf ("%d", a[n]);
}

int main () {

	freopen ("pod.in", "r", stdin);
	freopen ("pod.out", "w", stdout);
	
	citire ();
	if (n <= 1000000)
		brute1 ();
	else {
		if (m == 0) 
			brute1 ();
		else
			brute1 ();
	}
	
	return 0;
}