#include <bits/stdc++.h>
using namespace std;
const int MAX = 200010;
const int MOD = 1009;
const long double PI = acosl(-1);
const int N = (1 << 20) + 5;
struct cplx {
  long double a, b;
  cplx(long double a = 0, long double b = 0) : a(a), b(b) {}
  const cplx operator+(const cplx &c) const { return cplx(a + c.a, b + c.b); }
  const cplx operator-(const cplx &c) const { return cplx(a - c.a, b - c.b); }
  const cplx operator*(const cplx &c) const {
    return cplx(a * c.a - b * c.b, a * c.b + b * c.a);
  }
  const cplx operator/(const long double &x) const {
    return cplx(a / x, b / x);
  }
  const cplx conj() const { return cplx(a, -b); }
};
int rev[N];
cplx w[N];
static cplx f[N];
void prepare(int &n) {
  int sz = __builtin_ctz(n);
  for (int i = 1; i < n; ++i)
    rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (sz - 1));
  w[0] = 0, w[1] = 1, sz = 1;
  while (1 << sz < n) {
    cplx w_n =
        cplx(cosl(2 * PI / (1 << (sz + 1))), sinl(2 * PI / (1 << (sz + 1))));
    for (int i = 1 << (sz - 1); i < (1 << sz); ++i) {
      w[i << 1] = w[i], w[i << 1 | 1] = w[i] * w_n;
    }
    ++sz;
  }
}
void fft(cplx *a, int n) {
  for (int i = 1; i < n - 1; ++i) {
    if (i < rev[i]) swap(a[i], a[rev[i]]);
  }
  for (int h = 1; h < n; h <<= 1) {
    for (int s = 0; s < n; s += h << 1) {
      for (int i = 0; i < h; ++i) {
        cplx &u = a[s + i], &v = a[s + i + h], t = v * w[h + i];
        v = u - t, u = u + t;
      }
    }
  }
}
vector<long long> multiply(vector<long long> a, vector<long long> b) {
  int n = a.size(), m = b.size(), sz = 1;
  while (sz < n + m - 1) sz <<= 1;
  prepare(sz);
  for (int i = 0; i < sz; ++i) f[i] = cplx(i < n ? a[i] : 0, i < m ? b[i] : 0);
  fft(f, sz);
  for (int i = 0; i <= (sz >> 1); ++i) {
    int j = (sz - i) & (sz - 1);
    cplx x = (f[i] * f[i] - (f[j] * f[j]).conj()) * cplx(0, -0.25);
    f[j] = x, f[i] = x.conj();
  }
  fft(f, sz);
  vector<long long> c(n + m - 1);
  for (int i = 0; i < n + m - 1; ++i) {
    c[i] = f[i].a / sz + 0.3;
    c[i] %= MOD;
  }
  return c;
}
vector<vector<long long>> V;
int cnt[MAX];
vector<long long> solve(int L, int R) {
  if (L == R) return V[L];
  int mid = (L + R) / 2;
  return multiply(solve(L, mid), solve(mid + 1, R));
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, k, x;
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    cnt[x]++;
  }
  for (int i = 1; i <= m; i++) {
    if (cnt[i]) V.push_back(vector<long long>(cnt[i] + 1, 1));
  }
  vector<long long> ans = solve(0, (int)V.size() - 1);
  if (ans.size() < k + 1)
    cout << 0 << '\n';
  else
    cout << ans[k] << '\n';
  return 0;
}
