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 long long N[] = {(1 << 21), (1 << 10), (1 << 18)};
const long long MOD[] = {476 * (1 << 21) + 1, 12 * (1 << 10) + 1,
                         22 * (1 << 18) + 1};
const long long OMEGA[] = {733596141, 10302, 1893080};
struct NTT {
  long long n;
  long long mod;
  long long root;
  NTT(long long n_, long long m, long long r) {
    n = n_;
    mod = m;
    root = r;
  }
  long long add(long long a, long long b) {
    a += b;
    if (a >= mod) a -= mod;
    return a;
  }
  long long sub(long long a, long long b) {
    a -= b;
    if (a < 0) a += mod;
    return a;
  }
  long long mul(long long a, long long b) { return a * b % mod; }
  long long fast_pow(long long a, long long exp) {
    long long temp = 1LL;
    while (exp > 0) {
      if (exp & 1) temp = mul(temp, a);
      a = mul(a, a);
      exp /= 2;
    }
    return temp;
  }
  vector<long long> ntt_iter(vector<long long> A, long long omega) {
    int j = 0;
    for (int i = 1; i < n; i++) {
      int k;
      for (k = n / 2; k <= j; k /= 2) j ^= k;
      j ^= k;
      if (i < j) swap(A[i], A[j]);
    }
    for (int len = 1; len < n; len *= 2) {
      long long om = fast_pow(omega, n / (len * 2));
      for (int i = 0; i < n; i += 2 * len) {
        long long w = 1;
        for (j = i; j < i + len; j++) {
          long long a = A[j];
          long long b = mul(A[j + len], w);
          A[j] = add(a, b);
          A[j + len] = sub(a, b);
          w = mul(w, om);
        }
      }
    }
    return A;
  }
  vector<long long> ntt(vector<long long> A, long long omega) {
    int len = A.size();
    if (len == 1) return {A[0]};
    vector<long long> V1(len / 2);
    vector<long long> V2(len / 2);
    for (int i = 0; i < len / 2; i++) {
      V1[i] = A[2 * i];
      V2[i] = A[2 * i + 1];
    }
    long long new_omega = mul(omega, omega);
    vector<long long> res1 = ntt(V1, new_omega);
    vector<long long> res2 = ntt(V2, new_omega);
    vector<long long> res(len);
    long long temp = 1LL;
    for (int i = 0; i < len / 2; i++) {
      res[i] = add(res1[i], mul(temp, res2[i]));
      res[i + len / 2] = sub(res1[i], mul(temp, res2[i]));
      temp = mul(temp, omega);
    }
    return res;
  }
  vector<long long> mul_poly(vector<long long> A, vector<long long> B) {
    A.resize(n);
    B.resize(n);
    A = ntt_iter(A, root);
    B = ntt_iter(B, root);
    for (int i = 0; i < n; i++) A[i] = mul(A[i], B[i]);
    A = ntt_iter(A, fast_pow(root, mod - 2));
    long long inv = fast_pow(n, mod - 2);
    for (int i = 0; i < n; i++) A[i] = mul(A[i], inv);
    return A;
  }
};
struct FFT {
  long long n;
  complex<double> root;
  FFT(long long n_) {
    n = n_;
    long double PI = acos(-1.0);
    root = complex<double>(cos(2 * PI / n), sin(2 * PI / n));
  }
  complex<double> fast_pow(complex<double> a, long long exp) {
    complex<double> temp = complex<double>(1, 0);
    while (exp > 0) {
      if (exp & 1) temp = temp * a;
      a = a * a;
      exp /= 2;
    }
    return temp;
  }
  vector<complex<double> > ntt_iter(vector<complex<double> >& A,
                                    complex<double> omega) {
    int j = 0;
    for (int i = 1; i < n; i++) {
      int k;
      for (k = n / 2; k <= j; k /= 2) j ^= k;
      j ^= k;
      if (i < j) swap(A[i], A[j]);
    }
    for (int len = 1; len < n; len *= 2) {
      complex<double> om = fast_pow(omega, n / (len * 2));
      for (int i = 0; i < n; i += 2 * len) {
        complex<double> w = 1.;
        for (j = i; j < i + len; j++) {
          complex<double> a = A[j];
          complex<double> b = A[j + len] * w;
          A[j] = a + b;
          A[j + len] = a - b;
          w = w * om;
        }
      }
    }
    return A;
  }
  vector<complex<double> > mul_poly(vector<complex<double> >& A,
                                    vector<complex<double> >& B) {
    A.resize(n);
    B.resize(n);
    A = ntt_iter(A, root);
    B = ntt_iter(B, root);
    for (int i = 0; i < n; i++) A[i] = A[i] * B[i];
    A = ntt_iter(A, complex<double>(1, 0) / root);
    for (int i = 0; i < n; i++) A[i] = A[i] / complex<double>(n, 0);
    return A;
  }
};
const int maxn = 400005;
int n, m;
vector<int> mull(vector<int> Ain, vector<int> Bin) {
  int nn = max(Ain.size(), Bin.size()) - 1;
  int Nmoje = 1;
  while (Nmoje < 2 * nn + 1) {
    Nmoje *= 2;
  }
  FFT nt(Nmoje);
  vector<complex<double> > A(Nmoje);
  vector<complex<double> > B(Nmoje);
  for (int i = 0; i < Ain.size(); i++) A[i] = complex<double>(Ain[i], 0);
  for (int i = 0; i < Bin.size(); i++) B[i] = complex<double>(Bin[i], 0);
  vector<complex<double> > C = nt.mul_poly(A, B);
  vector<int> res(Nmoje, 0);
  for (int i = 0; i < C.size(); i++) res[i] = llround(real(C[i])) % 1009;
  return res;
}
int cnt[maxn];
vector<int> poly[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  int k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    x--;
    cnt[x]++;
  }
  set<pair<int, int> > S;
  for (int i = 0; i < m; i++) {
    if (cnt[i]) {
      poly[i] = vector<int>(cnt[i] + 1, 1);
      S.insert({cnt[i] + 1, i});
    }
  }
  while (S.size() > 1) {
    int u = S.begin()->second;
    S.erase(S.begin());
    int v = S.begin()->second;
    S.erase(S.begin());
    poly[m] = mull(poly[u], poly[v]);
    poly[u].clear();
    poly[u].shrink_to_fit();
    poly[v].clear();
    poly[v].shrink_to_fit();
    S.insert({poly[m].size(), m});
    m++;
  }
  cout << poly[S.begin()->second][k] << "\n";
  return 0;
}
