#include <bits/stdc++.h>
const int mod = 1009;
const int maxn = 200000;
using cd = std::complex<double>;
const double MPI = acos(-1);
int k;
cd pwlen[21][2];
void preCalc() {
  double angle;
  int cur = 0;
  int n = 1 << 20;
  for (int len = 2; len <= n; len <<= 1) {
    angle = 2 * MPI / len;
    pwlen[cur][0] = cd(cos(angle), sin(angle));
    pwlen[cur][1] = cd(cos(-angle), sin(-angle));
    ++cur;
  }
}
void fft(std::vector<cd>& a, bool invert) {
  int n = a.size();
  int bit = 0;
  for (int i = 1, j = 0; i < n; ++i) {
    bit = n >> 1;
    for (; j & bit; bit >>= 1) {
      j ^= bit;
    }
    j ^= bit;
    if (i < j) {
      std::swap(a[i], a[j]);
    }
  }
  cd w;
  int cur = 0;
  for (int len = 2; len <= n; len <<= 1) {
    for (int i = 0; i < n; i += len) {
      w = cd(1);
      for (int j = 0; j < (len >> 1); ++j) {
        cd u = a[i + j], v = a[i + j + (len >> 1)] * w;
        a[i + j] = u + v;
        a[i + j + (len >> 1)] = u - v;
        w *= pwlen[cur][invert];
      }
    }
    ++cur;
  }
  if (invert) {
    for (cd& x : a) {
      x /= n;
    }
  }
}
std::vector<int> multiply(std::vector<int> const& a,
                          std::vector<int> const& b) {
  std::vector<cd> fa(a.begin(), a.end()), fb(b.begin(), b.end());
  int n = 1;
  while (n < a.size() + b.size()) {
    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);
  n = std::min(n, k + 1);
  std::vector<int> ret(n);
  for (int i = 0; i < n; ++i) {
    ret[i] = (int64_t)round(fa[i].real()) % mod;
  }
  return ret;
}
int color[maxn + 5];
std::vector<int> calc(int left, int right) {
  if (left == right) {
    std::vector<int> ret;
    color[left - 1] = std::min(color[left - 1], k);
    for (int i = 0; i <= color[left - 1]; ++i) {
      ret.push_back(1);
    }
    return ret;
  }
  int mid = (left + right) >> 1;
  std::vector<int> fa = calc(left, mid);
  std::vector<int> fb = calc(mid + 1, right);
  return multiply(fa, fb);
}
int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);
  int n, m;
  std::cin >> n >> m >> k;
  int x;
  for (int i = 0; i < n; ++i) {
    std::cin >> x;
    ++color[--x];
  }
  preCalc();
  std::vector<int> result = calc(1, m);
  std::cout << result[k] % mod;
  return 0;
}
