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;
struct pol {
  int deg, *a;
  pol() : deg(0), a(0) {}
};
bool operator>(const pol &a, const pol &b) { return a.deg > b.deg; }
bool operator<(const pol &a, const pol &b) { return a.deg < b.deg; }
complex<double> a[262144], b[262144], r[262144], o[262145];
void fft(complex<double> *x, int n) {
  int base = 0;
  while ((1 << base) < n) ++base;
  int size = 0, mask = (n >> 1) - 1;
  for (int i = base - 1; i >= 0; --i, size = (size << 1) | 1, mask >>= 1) {
    for (int j = 0; j < n; ++j) {
      int front = j >> i, back = j & mask;
      int a = (front & size) << 1, b = a | 1;
      r[j] = x[(a << i) | back] +
             o[(front << i) * (262144 / n)] * x[(b << i) | back];
    }
    for (int j = 0; j < n; ++j) x[j] = r[j];
  }
}
void ifft(complex<double> *x, int n) {
  fft(x, n);
  reverse(x + 1, x + n);
  for (int i = 0; i < n; ++i) x[i] /= n;
}
void pin(pol p) {
  cout << "deg: " << p.deg << " : [ ";
  for (int i = 0; i <= p.deg; ++i) cout << p.a[i] << " ";
  cout << "]" << endl;
}
pol mg(pol pa, pol pb) {
  pol rt;
  int nn = rt.deg = pb.deg * 2;
  rt.a = new int[rt.deg + 1];
  for (int i = 0; i <= pa.deg; ++i) a[i] = complex<double>(pa.a[i], 0);
  for (int i = pa.deg + 1; i <= nn; ++i) a[i] = complex<double>(0, 0);
  for (int i = 0; i <= pb.deg; ++i) b[i] = complex<double>(pb.a[i], 0);
  for (int i = pb.deg + 1; i <= nn; ++i) b[i] = complex<double>(0, 0);
  fft(a, nn);
  fft(b, nn);
  for (int i = 0; i < nn; ++i) a[i] *= b[i];
  ifft(a, nn);
  for (int i = 0; i <= nn; ++i) rt.a[i] = (long long)round(real(a[i])) % 1009;
  return rt;
}
int cnt[200005];
int main() {
  for (int i = 0; i <= 262144; ++i)
    o[i] = exp(2. * i / 262144 * 3.1415926535 * complex<double>(0, 1));
  int n, m, k;
  cin >> n >> m >> k;
  while (n--) {
    int t;
    cin >> t;
    ++cnt[t];
  }
  priority_queue<pol, vector<pol>, greater<pol>> pq;
  for (int i = 1; i <= m; ++i) {
    if (cnt[i] == 0) continue;
    pol tmp;
    int nn = cnt[i] + 1;
    while (nn != (nn & -nn)) nn += nn & -nn;
    tmp.a = new int[nn + 1];
    tmp.deg = nn;
    for (int j = 0; j <= cnt[i]; ++j) tmp.a[j] = 1;
    for (int j = cnt[i] + 1; j <= nn; ++j) tmp.a[j] = 0;
    pq.push(tmp);
  }
  while (pq.size() > 1u) {
    pol p1 = pq.top();
    pq.pop();
    pol p2 = pq.top();
    pq.pop();
    pq.push(mg(p1, p2));
  }
  pol ans = pq.top();
  cout << ans.a[k] << endl;
}
