#include <bits/stdc++.h>
using namespace std;
struct CD {
  double r, i;
  CD(double r = 0, double i = 0) : r(r), i(i) {}
  double real() const { return r; }
  void operator/=(const int c) { r /= c, i /= c; }
};
CD operator*(const CD& a, const CD& b) {
  return CD(a.r * b.r - a.i * b.i, a.r * b.i + a.i * b.r);
}
CD operator+(const CD& a, const CD& b) { return CD(a.r + b.r, a.i + b.i); }
CD operator-(const CD& a, const CD& b) { return CD(a.r - b.r, a.i - b.i); }
const double pi = acos(-1.0);
const int MAXN = (1 << 19);
CD cp1[MAXN + 9], cp2[MAXN + 9];
int R[MAXN + 9];
void dft(CD* a, int n, bool inv) {
  for (long long i = 0; i < n; i++)
    if (R[i] < i) swap(a[R[i]], a[i]);
  for (int m = 2; m <= n; m *= 2) {
    double z = 2 * pi / m * (inv ? -1 : 1);
    CD wi = CD(cos(z), sin(z));
    for (int j = 0; j < n; j += m) {
      CD w(1);
      for (int k = j, k2 = j + m / 2; k2 < j + m; k++, k2++) {
        CD u = a[k];
        CD v = a[k2] * w;
        a[k] = u + v;
        a[k2] = u - v;
        w = w * wi;
      }
    }
  }
  if (inv)
    for (long long i = 0; i < n; i++) a[i] /= n;
}
vector<int> multiply(vector<int>& p1, vector<int>& p2) {
  int n = p1.size() + p2.size() + 1;
  int m = 1, cnt = 0;
  while (m <= n) m += m, cnt++;
  for (long long i = 0; i < m; i++) {
    R[i] = 0;
    for (long long j = 0; j < cnt; j++) R[i] = (R[i] << 1) | ((i >> j) & 1);
  }
  for (long long i = 0; i < m; i++) cp1[i] = 0, cp2[i] = 0;
  for (long long i = 0; i < p1.size(); i++) cp1[i] = p1[i];
  for (long long i = 0; i < p2.size(); i++) cp2[i] = p2[i];
  dft(cp1, m, false);
  dft(cp2, m, false);
  for (long long i = 0; i < m; i++) cp1[i] = cp1[i] * cp2[i];
  dft(cp1, m, true);
  vector<int> res;
  n -= 2;
  for (long long i = 0; i < n; i++)
    res.push_back(((long long)floor(cp1[i].real() + 0.5)) % 1009);
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> c(m, 0);
  for (long long i = 0; i < n; i++) {
    int x;
    cin >> x;
    x--;
    c[x]++;
  }
  priority_queue<pair<int, vector<int>>> q;
  for (long long i = 0; i < m; i++) {
    if (c[i]) {
      pair<int, vector<int>> x(-(c[i] + 1), vector<int>(c[i] + 1, 1));
      q.push(x);
    }
  }
  while (((int)(q).size()) > 1) {
    auto v = q.top().second;
    q.pop();
    auto vv = q.top().second;
    q.pop();
    v = multiply(v, vv);
    q.push({-(((int)(v).size())), v});
  }
  cout << q.top().second[k] << "\n";
  return 0;
}
