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;
template <typename Arg1>
void prn(Arg1 &&arg1) {
  cout << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void prn(Arg1 &&arg1, Args &&...args) {
  cout << arg1 << " ";
  prn(args...);
}
template <typename Arg1>
void prs(Arg1 &&arg1) {
  cout << arg1 << " ";
}
template <typename Arg1, typename... Args>
void prs(Arg1 &&arg1, Args &&...args) {
  cout << arg1 << " ";
  prs(args...);
}
template <typename Arg1>
void read(Arg1 &&arg1) {
  cin >> arg1;
}
template <typename Arg1, typename... Args>
void read(Arg1 &&arg1, Args &&...args) {
  cin >> arg1;
  read(args...);
}
inline void solve();
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  for (int tc = 1; tc <= t; ++tc) {
    solve();
  }
  return 0;
}
namespace fft {
const int maxn = 1 << 19, magic = 500;
complex<float> w[maxn];
const float pi = acos(-1);
bool initiated = 0;
void init() {
  if (!initiated) {
    for (int i = 1; i < maxn; i *= 2) {
      for (int j = 0; j < i; j++) {
        w[i + j] = polar(float(1), pi * j / i);
      }
    }
    initiated = 1;
  }
}
template <typename T>
void fft(T *in, complex<float> *out, int n, int k = 1) {
  if (n == 1) {
    *out = *in;
  } else {
    n /= 2;
    fft(in, out, n, 2 * k);
    fft(in + k, out + n, n, 2 * k);
    for (int i = 0; i < n; i++) {
      auto t = out[i + n] * w[i + n];
      out[i + n] = out[i] - t;
      out[i] += t;
    }
  }
}
template <typename T>
void mul_slow(vector<T> &a, const vector<T> &b) {
  vector<T> res(a.size() + b.size() - 1);
  for (size_t i = 0; i < a.size(); i++) {
    for (size_t j = 0; j < b.size(); j++) {
      res[i + j] += a[i] * b[j];
    }
  }
  a = res;
}
template <typename T>
void mul(vector<T> &a, const vector<T> &b) {
  init();
  if (min(a.size(), b.size()) < magic) {
    mul_slow(a, b);
    return;
  }
  static const int shift = 10, mask = (1 << shift) - 1;
  size_t n = a.size() + b.size() - 1;
  while (__builtin_popcount(n) != 1) {
    n++;
  }
  a.resize(n);
  static complex<float> A[maxn], B[maxn];
  static complex<float> C[maxn], D[maxn];
  for (size_t i = 0; i < n; i++) {
    A[i] = complex<float>(a[i] & mask, a[i] >> shift);
    if (i < b.size()) {
      B[i] = complex<float>(b[i] & mask, b[i] >> shift);
    } else {
      B[i] = 0;
    }
  }
  fft(A, C, n);
  fft(B, D, n);
  for (size_t i = 0; i < n; i++) {
    complex<float> c0 = C[i] + conj(C[(n - i) % n]);
    complex<float> c1 = C[i] - conj(C[(n - i) % n]);
    complex<float> d0 = D[i] + conj(D[(n - i) % n]);
    complex<float> d1 = D[i] - conj(D[(n - i) % n]);
    A[i] = c0 * d0 - complex<float>(0, 1) * c1 * d1;
    B[i] = c0 * d1 + d0 * c1;
  }
  fft(A, C, n);
  fft(B, D, n);
  reverse(C + 1, C + n);
  reverse(D + 1, D + n);
  int t = 4 * n;
  for (size_t i = 0; i < n; i++) {
    int64_t A0 = llround(real(C[i]) / t);
    T A1 = llround(imag(D[i]) / t);
    T A2 = llround(imag(C[i]) / t);
    a[i] = A0 + (A1 << shift) + (A2 << 2 * shift);
  }
  return;
}
}  // namespace fft
const int N = 2e5 + 1, mod = 1009;
int f[N];
int n, m, k;
bool operator<(vector<long long> &v1, vector<long long> &v2) {
  return v1.size() > v2.size();
}
vector<vector<int> > polys;
struct compar {
  bool operator()(int i1, int i2) {
    return polys[i1].size() > polys[i2].size();
  }
};
inline void solve() {
  read(n, m, k);
  for (int i = 0; i < n; ++i) {
    int cur;
    read(cur);
    ++f[cur];
  }
  priority_queue<int, vector<int>, compar> pq;
  polys.push_back(vector<int>(1, 1));
  for (int i = 1; i <= m; ++i) {
    if (!f[i]) {
      continue;
    }
    polys.push_back(vector<int>(f[i] + 1, 1));
  }
  for (int i = 0; i < polys.size(); ++i) {
    pq.push(i);
  }
  while (pq.size() > 1) {
    int i1 = pq.top();
    vector<int> &p1 = polys[i1];
    pq.pop();
    vector<int> &p2 = polys[pq.top()];
    pq.pop();
    fft::mul(p1, p2);
    if (p1.size() > k + 1) {
      p1.resize(k + 1);
    }
    for (auto &i : p1) {
      i %= mod;
    }
    pq.push(i1);
  }
  vector<int> &p = polys[pq.top()];
  int ans = 0;
  p.resize(k + 1);
  prn(p.back());
}
