#include <bits/stdc++.h>

using namespace std;

ifstream f ("pod.in");
ofstream g ("pod.out");

const int Dim = 1e6 + 5;
const int Mod = 9901;

bool ok[Dim];

int dp[Dim];
int n, m, k;

int main() {
    f >> n >> m >> k;
    for (int i = 1; i <= m; ++ i) {
        int x; f >> x;
        ok[x] = true;
    }

    dp[0] = 1;
    for (int i = 1; i <= n; ++ i) {
        if (ok[i] == true)
            continue;

        if (i >= k)
            dp[i] = (dp[i - k] + dp[i - 1]) % Mod;
        else
            dp[i] = dp[i - 1];
    }

    g << dp[n] << '\n';
    return 0;
}