#include <fstream>
#include <algorithm>
#include <cstring>

using namespace std;

ifstream cin("pod.in");
ofstream cout("pod.out");

const int MAXM = 1000;
const int MAXK = 20;
const int MOD = 9901;

int v[1 + MAXM];
int answer[1 + MAXK][1 + MAXK], base[1 + MAXK][1 + MAXK], temp[1 + MAXK][1 + MAXK];

void Multiply(int a[1 + MAXK][1 + MAXK], int b[1 + MAXK][1 + MAXK], int n) {
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            temp[i][j] = 0;
            for (int k = 1; k <= n; k++)
                temp[i][j] = temp[i][j] + a[i][k] * b[k][j];
            temp[i][j] %= MOD;
        }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            a[i][j] = temp[i][j];
}

void RaiseToPower(int power, int k) {
    memset(base, 0, sizeof(base));
    for (int i = 1; i <= k; i++)
        base[i][i - 1] = 1;
    base[1][k] = base[k][k] = 1;
    while (power) {
        if (power % 2)
            Multiply(answer, base, k);
        Multiply(base, base, k);
        power /= 2;
    }
}

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i <= m; i++)
        cin >> v[i];
    sort(v + 1, v + m + 1);
    m++;
    v[m] = n;
    answer[1][k] = 1;
    for (int i = 1; i <= m; i++) {
        RaiseToPower(v[i] - v[i - 1], k);
        if (i < m)
            answer[1][k] = 0;
    }
    cout << answer[1][k] << "\n";
    return 0;
}