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>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f;
const long long MOD = 1000000007;
const int IT_MAX = 1 << 17;
const int MX = 1000005;
namespace FFT {
const double C_PI = acos(-1);
void fft(vector<complex<double> > &a, bool invert) {
  int n = ((int)(a).size());
  for (int i = 0, j = 0; i < n; ++i) {
    if (i > j) swap(a[i], a[j]);
    for (int k = n >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  for (int len = 2; len <= n; len <<= 1) {
    double ang = 2 * C_PI / len * (invert ? -1 : 1);
    complex<double> wlen(cos(ang), sin(ang));
    for (int i = 0; i < n; i += len) {
      complex<double> w(1);
      for (int j = 0; j < len / 2; j++) {
        if ((j & 511) == 511) w = complex<double>(cos(ang * j), sin(ang * j));
        complex<double> u = a[i + j], v = a[i + j + len / 2] * w;
        a[i + j] = u + v;
        a[i + j + len / 2] = u - v;
        w *= wlen;
      }
    }
  }
  if (invert) {
    for (int i = 0; i < n; i++) a[i] /= n;
  }
}
void multiply(const vector<int> &a, const vector<int> &b, vector<int> &res,
              const int MOD) {
  vector<complex<double> > fa((a).begin(), (a).end()),
      fb((b).begin(), (b).end());
  int n = 1;
  while (n < max(((int)(a).size()), ((int)(b).size()))) n <<= 1;
  n <<= 1;
  fa.resize(n);
  fb.resize(n);
  fft(fa, false);
  fft(fb, false);
  for (int i = 0; i < n; i++) fa[i] *= fb[i];
  fft(fa, true);
  res.resize(n);
  for (int i = 0; i < n; i++)
    res[i] =
        ((long long)(fa[i].real() + (fa[i].real() > 0 ? 0.5 : -0.5))) % MOD;
}
void multiply_with_modulo(const vector<int> &a, const vector<int> &b,
                          vector<int> &res, const int MOD) {
  int n = 1;
  while (n < max(((int)(a).size()), ((int)(b).size()))) n <<= 1;
  n <<= 1;
  vector<complex<double> > A(n), B(n);
  int L_BLOCK = 15;
  for (int i = 0; i < n; i++)
    A[i] = (i < ((int)(a).size())
                ? complex<double>(a[i] & ((1 << L_BLOCK) - 1), a[i] >> L_BLOCK)
                : complex<double>(0));
  for (int i = 0; i < n; i++)
    B[i] = (i < ((int)(b).size())
                ? complex<double>(b[i] & ((1 << L_BLOCK) - 1), b[i] >> L_BLOCK)
                : complex<double>(0));
  fft(A, false);
  fft(B, false);
  vector<complex<double> > f1(n), f2(n), f3(n), f4(n);
  for (int i = 0; i < n; i++) {
    int j = (n - i) & (n - 1);
    f2[i] = (A[i] + conj(A[j])) * complex<double>(0.5, 0);
    f1[i] = (A[i] - conj(A[j])) * complex<double>(0, -0.5);
    f4[i] = (B[i] + conj(B[j])) * complex<double>(0.5, 0);
    f3[i] = (B[i] - conj(B[j])) * complex<double>(0, -0.5);
  }
  for (int i = 0; i < n; i++) {
    A[i] = f1[i] * f3[i] + f1[i] * f4[i] * complex<double>(0, 1);
    B[i] = f2[i] * f4[i] * complex<double>(0, 1) + f2[i] * f3[i];
  }
  fft(A, true);
  fft(B, true);
  res.resize(n);
  for (int i = 0; i < n; i++) {
    long long g1 = (long long)(A[i].real() + 0.5) % MOD;
    long long g2 = (long long)(A[i].imag() + 0.5) % MOD;
    long long g3 = (long long)(B[i].real() + 0.5) % MOD;
    long long g4 = (long long)(B[i].imag() + 0.5) % MOD;
    res[i] = (g4 + ((g2 + g3) << L_BLOCK) + (g1 << (L_BLOCK << 1))) % MOD;
  }
}
void multiply_big(const vector<int> &a, const vector<int> &b,
                  vector<long long> &res) {
  int n = 1;
  while (n < max(((int)(a).size()), ((int)(b).size()))) n <<= 1;
  n <<= 1;
  vector<complex<double> > A(n), B(n);
  int L_BLOCK = 10;
  for (int i = 0; i < n; i++)
    A[i] = (i < ((int)(a).size())
                ? complex<double>(a[i] & ((1 << L_BLOCK) - 1), a[i] >> L_BLOCK)
                : complex<double>(0));
  for (int i = 0; i < n; i++)
    B[i] = (i < ((int)(b).size())
                ? complex<double>(b[i] & ((1 << L_BLOCK) - 1), b[i] >> L_BLOCK)
                : complex<double>(0));
  fft(A, false);
  fft(B, false);
  vector<complex<double> > f1(n), f2(n), f3(n), f4(n);
  for (int i = 0; i < n; i++) {
    int j = (n - i) & (n - 1);
    f2[i] = (A[i] + conj(A[j])) * complex<double>(0.5, 0);
    f1[i] = (A[i] - conj(A[j])) * complex<double>(0, -0.5);
    f4[i] = (B[i] + conj(B[j])) * complex<double>(0.5, 0);
    f3[i] = (B[i] - conj(B[j])) * complex<double>(0, -0.5);
  }
  for (int i = 0; i < n; i++) {
    A[i] = f1[i] * f3[i] + f1[i] * f4[i] * complex<double>(0, 1);
    B[i] = f2[i] * f4[i] * complex<double>(0, 1) + f2[i] * f3[i];
  }
  fft(A, true);
  fft(B, true);
  res.resize(n);
  for (int i = 0; i < n; i++) {
    long long g1 = (long long)(A[i].real() + 0.5);
    long long g2 = (long long)(A[i].imag() + 0.5);
    long long g3 = (long long)(B[i].real() + 0.5);
    long long g4 = (long long)(B[i].imag() + 0.5);
    res[i] = (g4 + ((g2 + g3) << (L_BLOCK)) + (g1 << (L_BLOCK << 1)));
  }
}
}  // namespace FFT
int n, m, k;
vector<int> X[200020];
int A[200020];
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    --x;
    A[x]++;
  }
  for (int i = 0; i < m; i++) {
    X[i].resize(A[i] + 1);
    for (int j = 0; j < A[i] + 1; j++) X[i][j] = 1;
  }
  for (int i = 1; i < m; i *= 2) {
    for (int j = 0; i + j < m; j += 2 * i) {
      FFT::multiply(X[j], X[j + i], X[j], 1009);
      while ((int)(X[j]).size() > 1 && X[j].back() == 0) X[j].pop_back();
    }
  }
  printf("%d\n", (int)(X[0]).size() < k + 1 ? 0 : X[0][k]);
  return 0;
}
