#include <bits/stdc++.h>
using namespace std;
const long long modu = 1009;
struct CD {
  double r, i;
  CD(double r = 0, double i = 0) : r(r), i(i) {}
  double real() const { return r; }
  void operator/=(const long long 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);
const long long MAXN = 1 << 21;
CD cp1[MAXN + 9], cp2[MAXN + 9];
long long R[MAXN + 9];
void dft(CD* a, long long n, bool inv) {
  for (int i = (int)0; i < (int)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 (int i = (int)0; i < (int)n; i++) a[i] /= n;
}
vector<long long> multiply(vector<long long>& p1, vector<long long>& p2) {
  long long n = (int)(p1.size()) + (int)(p2.size()) + 1;
  long long m = 1, cnt = 0;
  while (m <= n) m += m, cnt++;
  for (int i = (int)0; i < (int)m; i++) {
    R[i] = 0;
    for (int j = (int)0; j < (int)cnt; j++) R[i] = (R[i] << 1) | ((i >> j) & 1);
  }
  for (int i = (int)0; i < (int)m; i++) cp1[i] = cp2[i] = 0;
  for (int i = (int)0; i < (int)(int)(p1.size()); i++) cp1[i] = p1[i];
  for (int i = (int)0; i < (int)(int)(p2.size()); i++) cp2[i] = p2[i];
  dft(cp1, m, 0);
  dft(cp2, m, 0);
  for (int i = (int)0; i < (int)m; i++) cp1[i] = cp1[i] * cp2[i];
  dft(cp1, m, 1);
  vector<long long> res;
  n -= 2;
  for (int i = (int)0; i < (int)n; i++)
    res.push_back((long long)floor(cp1[i].real() + .5));
  for (int i = (int)0; i < (int)n; i++) res[i] %= modu;
  return res;
}
vector<long long> dp(int l, int r, vector<vector<long long> >& todos) {
  if (l == r) return todos[l];
  int med = (l + r) / 2;
  vector<long long> left = dp(l, med, todos);
  vector<long long> right = dp(med + 1, r, todos);
  return multiply(left, right);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<long long> v(n);
  vector<long long> cont(n + 1, 0);
  for (int i = (int)0; i < (int)n; i++) cin >> v[i], cont[v[i]]++;
  vector<long long> ans = {1};
  vector<vector<long long> > todos;
  todos.push_back(ans);
  for (int i = (int)0; i < (int)n + 1; i++) {
    if (cont[i] == 0) continue;
    vector<long long> aux;
    for (int j = (int)0; j < (int)cont[i] + 1; j++) aux.push_back(1);
    todos.push_back(aux);
  }
  ans = dp(0, todos.size() - 1, todos);
  cout << ans[k] << "\n";
  return 0;
}
