#include <bits/stdc++.h>
using namespace std;
const long long mod = 1009;
const int MAX = 263005;
template <typename T>
class cmplx {
 private:
  T x, y;

 public:
  cmplx() : x(0.0), y(0.0) {}
  cmplx(T a) : x(a), y(0.0) {}
  cmplx(T a, T b) : x(a), y(b) {}
  T get_real() { return this->x; }
  T get_img() { return this->y; }
  cmplx conj() { return cmplx(this->x, -(this->y)); }
  cmplx operator=(const cmplx& a) {
    this->x = a.x;
    this->y = a.y;
    return *this;
  }
  cmplx operator+(const cmplx& b) {
    return cmplx(this->x + b.x, this->y + b.y);
  }
  cmplx operator-(const cmplx& b) {
    return cmplx(this->x - b.x, this->y - b.y);
  }
  cmplx operator*(const T& num) { return cmplx(this->x * num, this->y * num); }
  cmplx operator/(const T& num) { return cmplx(this->x / num, this->y / num); }
  cmplx operator*(const cmplx& b) {
    return cmplx(this->x * b.x - this->y * b.y, this->y * b.x + this->x * b.y);
  }
  cmplx operator/(const cmplx& b) {
    cmplx temp(b.x, -b.y);
    cmplx n = (*this) * temp;
    return n / (b.x * b.x + b.y * b.y);
  }
};
template <typename T, typename S>
struct FFT {
  S PI;
  int n, L, *rev, last;
  cmplx<S> ONE, ZERO;
  cmplx<S>* omega_powers;
  FFT() {
    PI = acos(-1.0);
    ONE = cmplx<S>(1.0, 0.0);
    ZERO = cmplx<S>(0.0, 0.0);
    last = -1;
    int req = 1 << (32 - __builtin_clz(MAX));
    rev = new int[req];
    omega_powers = new cmplx<S>[req];
  }
  ~FFT() {
    delete rev;
    delete omega_powers;
  }
  void ReverseBits() {
    if (n != last) {
      for (int i = 1, j = 0; i < n; ++i) {
        int bit = n >> 1;
        for (; j >= bit; bit >>= 1) j -= bit;
        j += bit;
        rev[i] = j;
      }
    }
  }
  void DFT(vector<cmplx<S>>& A, bool inverse = false) {
    for (int i = 0; i < n; ++i)
      if (rev[i] > i) swap(A[i], A[rev[i]]);
    for (int s = 1; s <= L; s++) {
      int m = 1 << s, half = m / 2;
      cmplx<S> wm(cos(2.0 * PI / m), sin(2.0 * PI / m));
      if (inverse) wm = ONE / wm;
      omega_powers[0] = ONE;
      for (int k = 1; k < half; ++k) {
        omega_powers[k] = omega_powers[k - 1] * wm;
      }
      for (int k = 0; k < n; k += m) {
        for (int j = 0; j < half; j++) {
          cmplx<S> t = omega_powers[j] * A[k + j + half];
          cmplx<S> u = A[k + j];
          A[k + j] = u + t;
          A[k + j + half] = u - t;
        }
      }
    }
    if (inverse) {
      for (int i = 0; i < n; i++) A[i] = A[i] / n;
    }
  }
  vector<T> Multiply(const vector<T>& a, const vector<T>& b) {
    L = 0;
    int sa = a.size(), sb = b.size(), sc = sa + sb - 1;
    while ((1 << L) < sc) L++;
    n = 1 << L;
    ReverseBits();
    last = n;
    vector<cmplx<S>> aa(n, ZERO), bb(n, ZERO), cc;
    for (int i = 0; i < sa; ++i) aa[i] = cmplx<S>(a[i], 0);
    for (int i = 0; i < sb; ++i) bb[i] = cmplx<S>(b[i], 0);
    DFT(aa, false);
    DFT(bb, false);
    for (int i = 0; i < n; ++i) cc.push_back(aa[i] * bb[i]);
    DFT(cc, true);
    vector<T> ans(sc);
    for (int i = 0; i < sc; ++i) {
      ans[i] = cc[i].get_real() + 0.5;
      ans[i] %= mod;
    }
    return ans;
  }
  vector<T> Multiply(const vector<T>& a) {
    L = 0;
    int sa = a.size(), sc = sa + sa - 1;
    while ((1 << L) < sc) L++;
    n = 1 << L;
    ReverseBits();
    last = n;
    vector<cmplx<S>> aa(n, ZERO), cc;
    for (int i = 0; i < sa; ++i) aa[i] = cmplx<S>(a[i], 0);
    DFT(aa, false);
    for (int i = 0; i < n; ++i) cc.push_back(aa[i] * aa[i]);
    DFT(cc, true);
    vector<T> ans(sc);
    for (int i = 0; i < sc; ++i) ans[i] = cc[i].get_real() + 0.5;
    return ans;
  }
};
FFT<long long, long double> fft;
int n, m, k;
const int N = 2 * 1e5;
vector<int> f;
vector<long long> cal(int st, int en) {
  if (st == en) {
    int tk = min(k, f[st]);
    vector<long long> vec(tk + 1, 1);
    return vec;
  }
  int mid = (st + en) / 2;
  vector<long long> v1 = cal(st, mid), v2 = cal(mid + 1, en);
  v1 = fft.Multiply(v1, v2);
  if (v1.size() > k + 1) v1.resize(k + 1);
  return v1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> k;
  f.resize(m, 0);
  int x;
  for (int i = 0; i < n; ++i) {
    cin >> x;
    --x;
    ++f[x];
  }
  sort(f.begin(), f.end(), greater<int>());
  while (!f.empty() && f.back() == 0) f.pop_back();
  if (f.empty()) {
    cout << 0;
    return 0;
  }
  m = f.size();
  vector<long long> res = cal(0, m - 1);
  if (res.size() < k + 1) {
    cout << 0;
    return 0;
  }
  long long ans = res[k];
  if (ans < 0) ans += mod;
  cout << ans;
  return 0;
}
