#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool uax(T &x, T y) {
  return (y > x) ? x = y, true : false;
}
template <typename T>
inline bool uin(T &x, T y) {
  return (y < x) ? x = y, true : false;
}
void err(istream_iterator<string>) {}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> buf) {
  return os << "(" << buf.first << ": " << buf.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
  for (auto &B : A) os << '\n' << B;
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
  bool f = false;
  os << "{";
  for (const auto e : A) {
    if (f) os << ", ";
    os << e;
    f = true;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &A) {
  bool f = false;
  os << "{";
  for (const auto e : A) {
    if (f) os << ", ";
    os << e;
    f = true;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, multiset<T> &A) {
  bool f = false;
  os << "{";
  for (const auto e : A) {
    if (f) os << ", ";
    os << e;
    f = true;
  }
  return os << "}";
}
template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> &A) {
  bool f = false;
  os << "{";
  for (auto &e : A) {
    if (f) os << ", ";
    os << e;
    f = true;
  }
  return os << "}";
}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " =: " << a << endl;
  err(++it, args...);
}
template <typename T>
void kek(T ans) {
  cout << ans << endl;
  exit(0);
}
int const MOD = 1000000007;
long long const INF = 1e18;
namespace FFT {
struct Complex {
  double real, imag;
  Complex() = default;
  Complex(const double x, const double y = 0) : real(x), imag(y) {}
  Complex &operator*=(const Complex &rhs) {
    const double temp = real * rhs.real - imag * rhs.imag;
    imag = real * rhs.imag + imag * rhs.real;
    real = temp;
    return *this;
  }
  friend Complex operator*(Complex lhs, const Complex &rhs) {
    lhs *= rhs;
    return lhs;
  }
  Complex &operator+=(const Complex &rhs) {
    real += rhs.real, imag += rhs.imag;
    return *this;
  }
  friend Complex operator+(Complex lhs, const Complex &rhs) {
    lhs += rhs;
    return lhs;
  }
  Complex &operator-=(const Complex &rhs) {
    real -= rhs.real, imag -= rhs.imag;
    return *this;
  }
  friend Complex operator-(Complex lhs, const Complex &rhs) {
    lhs -= rhs;
    return lhs;
  }
  Complex &operator/=(const double &rhs) {
    real /= rhs, imag /= rhs;
    return *this;
  }
};
const int MOD = 1009;
const double PI = acos((double)-1);
const int MAX = 1 << 19;
static int bits[MAX];
static Complex root[MAX], iroot[MAX];
inline void prepare_roots() {
  root[1] = iroot[1] = 1;
  for (int len = 2; len < MAX; len *= 2) {
    const Complex w(cos(PI / len), sin(PI / len)),
        iw(cos(PI / len), -sin(PI / len));
    for (int i = len >> 1; i < len; ++i) {
      root[i + i] = root[i];
      root[i + i + 1] = root[i] * w;
      iroot[i + i] = iroot[i];
      iroot[i + i + 1] = iroot[i] * iw;
    }
  }
}
inline void prepare_cache(int n) {
  static int last = -1;
  if (last == n) return;
  last = n;
  int lg = 0;
  while (1 << (lg + 1) < n) ++lg;
  for (int i = 1; i < n; ++i) bits[i] = (bits[i >> 1] >> 1) | ((i & 1) << lg);
}
void fft(vector<Complex> &a, bool invert) {
  int n = (int)a.size();
  if (n == 1) return;
  for (int i = 1; i < n; i++)
    if (i > bits[i]) swap(a[i], a[bits[i]]);
  const auto ws = (invert ? iroot : root);
  for (int len = 1; len < n; len *= 2) {
    for (int i = 0; i < n; i += len << 1) {
      for (int j = 0; j < len; j++) {
        const Complex v = a[i + j + len] * ws[len + j];
        a[i + j + len] = a[i + j] - v;
        a[i + j] += v;
      }
    }
  }
  if (invert)
    for (Complex &x : a) x /= n;
}
vector<int> multiply(vector<int> const &a, vector<int> const &b) {
  vector<Complex> fa(a.begin(), a.end()), fb(b.begin(), b.end());
  int n = 1;
  while (n < (int)(a.size() + b.size())) n <<= 1;
  fa.resize(n);
  fb.resize(n);
  prepare_cache(n);
  fft(fa, false);
  fft(fb, false);
  for (int i = 0; i < n; i++) fa[i] *= fb[i];
  fft(fa, true);
  vector<int> result(n);
  for (int i = 0; i < n; i++)
    result[i] = (int)((long long)round(fa[i].real) % MOD);
  return result;
}
}  // namespace FFT
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> counts(m);
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    --x;
    counts[x]++;
  }
  vector<vector<int>> poly;
  for (int i = 0; i < m; ++i) poly.emplace_back(counts[i] + 1, 1);
  auto order = [&](int i, int j) {
    if (poly[i].size() == poly[j].size()) return i < j;
    return poly[i].size() < poly[j].size();
  };
  set<int, decltype(order)> s(order);
  for (int i = 0; i < m; ++i)
    if (counts[i] > 0) s.insert(i);
  FFT::prepare_roots();
  while (true) {
    int i = *s.begin();
    s.erase(i);
    if (s.empty()) kek(poly[i][k]);
    int j = *s.begin();
    s.erase(j);
    poly[i] = FFT::multiply(poly[i], poly[j]);
    s.insert(i);
  }
  return 0;
}
