#include <bits/stdc++.h>
using namespace std;
long long MOD = 1009;
const int MAXN = 1 << 19;
double pi = acos(-1);
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); }
CD cp1[MAXN + 9], cp2[MAXN + 9];
int R[MAXN + 9];
void dft(CD* a, int n, bool inv) {
  for (int i = 0, ggdem = n; i < ggdem; 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 = 0, ggdem = n; i < ggdem; i++) a[i] /= n;
}
vector<long long> multiply(vector<long long>& p1, vector<long long>& p2) {
  int n = ((int)(p1).size()) + ((int)(p2).size()) + 1;
  int m = 1, cnt = 0;
  while (m <= n) m += m, cnt++;
  for (int i = 0, ggdem = m; i < ggdem; i++) {
    R[i] = 0;
    for (int j = 0, ggdem = cnt; j < ggdem; j++)
      R[i] = (R[i] << 1) | ((i >> j) & 1);
  }
  for (int i = 0, ggdem = m; i < ggdem; i++) cp1[i] = cp2[i] = 0;
  for (int i = 0, ggdem = ((int)(p1).size()); i < ggdem; i++) cp1[i] = p1[i];
  for (int i = 0, ggdem = ((int)(p2).size()); i < ggdem; i++) cp2[i] = p2[i];
  dft(cp1, m, false);
  dft(cp2, m, false);
  for (int i = 0, ggdem = m; i < ggdem; i++) cp1[i] = cp1[i] * cp2[i];
  dft(cp1, m, true);
  vector<long long> res;
  n -= 2;
  for (int i = 0, ggdem = n; i < ggdem; i++)
    res.push_back((long long)floor(cp1[i].real() + 0.5));
  return res;
}
int cnt[200010];
vector<vector<long long>> v;
vector<long long> solve(int l, int r) {
  if (l + 1 == r) return v[l];
  int m = (l + r) / 2;
  auto x = solve(l, m), y = solve(m, r);
  auto ans = multiply(x, y);
  for (int i = 0, ggdem = ((int)(ans).size()); i < ggdem; i++) ans[i] %= MOD;
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0, ggdem = n; i < ggdem; i++) {
    int x;
    cin >> x;
    cnt[x]++;
  }
  for (int i = 1, ggdem = m + 1; i < ggdem; i++)
    if (cnt[i]) v.push_back(vector<long long>(cnt[i] + 1, 1));
  vector<long long> ans = solve(0, ((int)(v).size()));
  cout << ans[k] << "\n";
}
