#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
using ll = long long;
template <typename T>
using v = vector<T>;
static const ll PRIME = 1009;
static const double pi = 2.0 * acos(0.0);
struct Complex {
  double x, y;
  Complex() : x(0.0), y(0.0) {}
  Complex(double xin, double yin) : x(xin), y(yin) {}
  Complex operator+(const Complex& rhs) { return (Complex) * this += rhs; };
  Complex operator-(const Complex& rhs) { return (Complex) * this -= rhs; };
  friend Complex operator*(const Complex& lhs, const Complex& rhs) {
    return Complex(lhs.x * rhs.x - lhs.y * rhs.y,
                   lhs.x * rhs.y + lhs.y * rhs.x);
  }
  Complex& operator+=(const Complex& rhs) {
    x += rhs.x;
    y += rhs.y;
    return *this;
  }
  Complex& operator-=(const Complex& rhs) {
    x -= rhs.x;
    y -= rhs.y;
    return *this;
  }
  double real() { return x; }
};
inline Complex conj(const Complex& z) { return Complex(z.x, -z.y); }
using clx = Complex;
v<clx> roots;
inline ll getmod(ll a, ll mod) {
  assert(mod > 0);
  return (a % mod + mod) % mod;
}
inline ll log2ll(ll a) {
  ll result = 0;
  while (a >>= 1) result++;
  return result;
}
inline ll pow2ll(ll a) { return (1LL << a); }
inline v<ll> getreverse(ll deg) {
  ll n = 1 + log2ll(deg), twon = pow2ll(n);
  v<ll> result(twon);
  for (ll i = 1; i < twon; i++) {
    result[i] = (result[i >> 1] >> 1) | ((i & 1) << (n - 1));
  }
  return result;
}
inline v<clx> getroots(ll deg) {
  ll twok = pow2ll(1 + log2ll(deg));
  v<clx> res(twok);
  for (ll i = 0; i < twok / 2; i++) {
    double angle = (2 * pi * i) / twok;
    res[i + twok / 2] = clx(cos(angle), sin(angle));
  }
  for (ll i = twok / 2 - 1; i >= 1; i--) {
    res[i] = res[2 * i];
  }
  return res;
}
inline v<clx> fft(const v<clx>& coefs, const v<ll>& reverse) {
  assert(coefs.size() == reverse.size());
  ll twok = coefs.size();
  v<clx> f(twok);
  for (ll i = 0; i < twok; i++) {
    f[i] = coefs[reverse[i]];
  }
  for (ll k = 1; k < twok; k <<= 1) {
    for (ll i = 0; i < twok; i += 2 * k) {
      for (ll j = 0; j < k; j++) {
        clx r = f[i + j + k] * roots[j + k];
        f[i + j + k] = f[i + j] - r;
        f[i + j] += r;
      }
    }
  }
  return f;
}
inline v<ll> mul(const v<ll>& a, const v<ll>& b) {
  ll adeg = a.size() - 1, bdeg = b.size() - 1, newdeg = adeg + bdeg;
  ll n = 1 + log2ll(newdeg), twon = pow2ll(n);
  v<clx> in(twon);
  for (ll i = 0; i < twon; i++) {
    in[i] = clx(i <= adeg ? a[i] : 0, i <= bdeg ? b[i] : 0);
  }
  v<ll> reverse = getreverse(newdeg);
  v<clx> out = fft(in, reverse);
  for (ll i = 0; i < twon; i++) {
    ll j = i ? (twon - i) : 0;
    in[i] = (out[j] * out[j] - conj(out[i] * out[i])) * clx(0.0, -0.25);
  }
  out = fft(in, reverse);
  v<ll> result(newdeg + 1);
  for (ll i = 0; i <= newdeg; i++) {
    result[i] = getmod(llround(out[i].real() / twon), PRIME);
  }
  return result;
}
int main(int argc, char const* argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  ll n, m, k, color;
  cin >> n >> m >> k;
  roots = getroots(n);
  v<ll> colorcount(m);
  for (ll i = 0; i < n; i++) {
    cin >> color;
    colorcount[color - 1]++;
  }
  auto fn = [](const v<ll>& a, const v<ll>& b) { return a.size() > b.size(); };
  priority_queue<v<ll>, v<v<ll>>, decltype(fn)> minpoly(fn);
  for (ll i = 0; i < m; i++) {
    if (colorcount[i] > 0) {
      minpoly.push(v<ll>(colorcount[i] + 1, 1));
    }
  }
  while (minpoly.size() > 1) {
    v<ll> p0 = minpoly.top();
    minpoly.pop();
    v<ll> p1 = minpoly.top();
    minpoly.pop();
    minpoly.push(mul(p0, p1));
  }
  v<ll> finalpoly = minpoly.top();
  cout << finalpoly[k] << endl;
  return 0;
}
