10 2 5
1 1 1 2 2 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 2 2 2 2
 3 3 2
1 3 1
 8 8 7
7 2 8 6 8 5 3 8
 7 7 5
2 6 3 6 3 5 1
 5 5 1
5 2 5 1 2
 6 6 6
5 6 5 3 4 2
 5 5 2
2 3 2 2 4
 3 3 3
1 1 1
 111 78 54
24 13 49 22 52 38 38 63 21 10 9 56 60 47 11 78 23 52 55 12 72 33 17 14 33 59 21 32 20 73 1 60 27 64 23 74 36 49 69 14 29 37 19 61 52 33 26 27 10 11 34 25 62 47 36 12 63 45 31 71 78 1 6 26 36 65 56 46 19 28 77 64 56 8 77 38 3 33 63 77 40 7 22 13 60 14 57 43 51 10 30 21 7 67 32 11 12 9 72 24 27 67 25 63 6 67 69 37 26 19 26
 10 2 5
1 1 1 1 1 1 1 1 1 2
 6 6 1
4 5 6 3 5 3
 10 2 5
1 1 1 1 2 2 2 2 2 2
 8 8 3
8 8 2 7 8 2 3 5
 7 7 4
4 6 6 7 2 5 3
 10 2 5
2 2 2 2 2 2 2 2 2 2
 111 67 97
32 67 4 15 17 17 23 6 39 54 19 62 28 59 63 36 44 40 28 67 28 3 55 19 11 26 3 38 22 26 62 54 61 15 22 4 47 53 27 36 31 5 16 59 51 62 51 46 7 55 26 66 50 51 32 17 54 14 18 14 40 30 24 2 61 16 16 27 55 58 35 7 26 3 26 4 13 59 14 32 56 54 5 46 39 30 45 24 37 12 67 38 45 32 41 21 46 26 41 29 15 28 65 5 19 53 13 31 58 18 57
 6 6 2
4 4 2 4 2 3
 10 2 5
1 1 1 1 1 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 1 1 2 2
 6 6 4
5 2 4 3 1 5
 10 2 5
1 1 2 2 2 2 2 2 2 2
 1 1 1
1
 8 8 5
7 5 6 8 2 8 3 4
 10 2 5
1 1 1 1 1 1 1 2 2 2
 111 101 52
54 69 33 81 8 90 48 21 96 35 44 75 68 34 101 82 93 94 86 76 33 91 5 70 22 84 70 71 62 81 50 83 51 43 95 46 19 53 101 34 51 40 6 17 69 60 73 89 65 75 59 68 62 49 89 23 63 83 86 68 62 39 1 18 3 75 44 57 9 24 67 81 83 45 93 66 79 71 43 49 17 2 33 38 98 71 71 21 56 16 31 2 75 61 64 38 69 80 81 12 68 95 26 9 69 82 41 35 75 7 71
 3 3 3
3 3 1
 4 4 2
2 4 4 3
 10 2 5
1 2 2 2 2 2 2 2 2 2
 4 4 4
4 4 4 4
 3 3 2
1 2 3
 2 1 2
1 1
 5 5 3
3 4 1 5 5
 7 7 1
2 6 5 6 2 3 3
 111 9 57
9 9 2 6 8 6 5 8 9 7 3 9 1 2 6 6 5 3 1 1 6 1 8 4 3 9 8 6 8 1 9 8 5 8 6 9 4 5 7 3 1 6 4 3 2 5 7 3 1 7 9 1 7 1 3 5 9 5 6 2 2 7 9 7 1 5 5 5 5 2 6 5 7 3 8 9 7 3 6 5 1 9 2 9 9 8 8 7 9 1 6 2 4 5 7 4 8 9 9 2 7 7 6 9 8 2 1 3 3 1 5
 4 4 1
2 4 1 4
 2 1 1
1 1
 111 16 58
15 6 4 7 7 10 16 2 3 1 4 8 10 1 2 11 6 6 14 16 6 16 1 2 13 2 7 13 1 4 1 4 12 2 4 11 15 12 9 13 10 4 11 7 5 3 12 11 11 3 16 15 9 6 15 11 4 14 8 15 16 3 9 10 9 1 8 4 14 7 13 5 1 8 5 11 8 14 1 8 15 2 5 2 4 5 9 2 10 11 11 5 7 11 11 14 5 16 14 2 4 11 12 10 7 14 2 5 3 2 1
 2 2 2
1 1

4
 5
 2
 6
 12
 3
 1
 4
 1
 648
 2
 4
 5
 19
 25
 1
 214
 5
 6
 3
 11
 3
 1
 41
 4
 881
 1
 4
 2
 1
 3
 1
 7
 4
 446
 3
 1
 552
 1

#include<bits/stdc++.h>
#define rep(i,a,b) for (int i=(a); i<=int(b); i++)
using namespace std;
typedef long long LL;

const int maxn = 1 << 19, MOD = 1009;
const double PI = acos(-1);
struct C {
    double r, i;
    C operator + (const C &a) const {
        return (C){r + a.r, i + a.i};
    }
    C operator - (const C &a) const {
        return (C){r - a.r, i - a.i};
    }
    C operator * (const C &a) const {
        return (C){r * a.r - i * a.i, r * a.i + i * a.r};
    }
} a[maxn], b[maxn], w[20][maxn], tmp;
int R[20][maxn], bin[20];

void prepare() {
	bin[0] = 1;
	rep (k, 1, 19) {
		bin[k] = bin[k-1] << 1;
		rep (i, 0, bin[k]-1)
			R[k][i] = (R[k][i>>1]>>1) | ((i&1)<<(k-1));
		w[k][0] = w[k][bin[k]] = (C){1, 0};
		w[k][1] = (C){cos(2*PI/bin[k]), sin(2*PI/bin[k])};
		rep (i, 2, bin[k]-1) w[k][i] = w[k][i-1] * w[k][1];
	}
}

void FFT(C a[maxn], int n, int flag) {
    rep (i, 0, bin[n]-1) if (i < R[n][i]) swap(a[i], a[R[n][i]]);
//	rep (i, 0, bin[n]-1) printf("~ %.2lf %.2lf\n", a[i].r, a[i].i);
	for (int d = 1, t = bin[n] >> 1; d < bin[n]; d <<= 1, t >>= 1)
        for (int i = 0; i < bin[n]; i += (d << 1))
            for (int j = 0; j < d; j++) {
                tmp = w[n][flag?bin[n]-t*j:t*j] * a[i+j+d];
                //printf("# %.2lf %.2lf\n", a[i+j+d].r, a[i+j+d].i);
                a[i+j+d] = a[i+j] - tmp;
                a[i+j] = a[i+j] + tmp;
            }
    if (!flag) return;
    for (int i=0; i<bin[n]; i++) a[i].r /= bin[n];
}

void mul(vector<int> &A, vector<int> &B, vector<int> &C) {
	int nA = A.size(), nB = B.size(), n = 1;
	while (bin[n] < nA + nB) n++;
	rep (i, 0, bin[n]-1)
		a[i].r = (i < A.size() ? A[i] : 0), a[i].i = 0;
	rep (i, 0, bin[n]-1)
		b[i].r = (i < B.size() ? B[i] : 0), b[i].i = 0;
//	rep (i, 0, bin[n]-1) printf("$ %.2lf %.2lf\n", a[i].r, a[i].i);
	FFT(a, n, 0); FFT(b, n, 0);
	rep (i, 0, bin[n]-1) a[i] = a[i] * b[i];
	FFT(a, n, 1);
//	rep (i, 0, bin[n]-1) printf("! %.2lf %.2lf\n", a[i].r, a[i].i);
//	puts("");
	rep (i, 0, bin[n]-1) C.push_back(LL(a[i].r + 0.3) % MOD);
}

/*********************FFT**********************/

vector<int> A[maxn<<1];
int cnt[maxn], n, m, K, tot, c, x, y;
struct Mycmp {
	bool operator () (const int &a, const int &b) const {
		return A[a].size() > A[b].size();
	}
};
priority_queue<int, vector<int>, Mycmp> Q;

int main() {
	scanf("%d%d%d", &n, &m, &K);
	rep (i, 1, n) { scanf("%d", &c), cnt[c]++; }
	rep (i, 1, m) if (cnt[i]) {
		tot++; A[tot].push_back(1);
		while (cnt[i]--) A[tot].push_back(1);
		Q.push(tot);
	}
	prepare();
	while (Q.size() >= 2) {
		x = Q.top(); Q.pop();
		y = Q.top(); Q.pop();
		mul(A[x], A[y], A[++tot]);
//		rep (i, 0, A[tot].size()-1)
//			printf("%d ", A[tot][i]);
//		puts("");
		Q.push(tot);
	}
	x = Q.top();
	printf("%d\n", A[x][K]);
	return 0;
}
