#include <bits/stdc++.h>
using namespace std;
int powr(int a, int b, int mod) {
  int x = 1 % mod;
  a %= mod;
  while (b) {
    if (b & 1) x = (x * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return x;
}
int inv(int a, int mod) { return powr(a, mod - 2, mod); }
struct base {
  double x, y;
  base() { x = y = 0; }
  base(double _x, double _y) { x = _x, y = _y; }
  base(double _x) { x = _x, y = 0; }
  void operator=(double _x) { x = _x, y = 0; }
  double real() { return x; }
  double imag() { return y; }
  base operator+(const base& b) { return base(x + b.x, y + b.y); }
  void operator+=(const base& b) { x += b.x, y += b.y; }
  base operator*(const base& b) {
    return base(x * b.x - y * b.y, x * b.y + y * b.x);
  }
  void operator*=(const base& b) {
    double p = x * b.x - y * b.y, q = x * b.y + y * b.x;
    x = p, y = q;
  }
  void operator/=(double k) { x /= k, y /= k; }
  base operator-(const base& b) { return base(x - b.x, y - b.y); }
  void operator-=(const base& b) { x -= b.x, y -= b.y; }
};
double PI = 2.0 * acos(0.0);
const int MAXN = 19;
const int maxn = (1 << MAXN);
base W[maxn], invW[maxn];
void precompute_powers() {
  for (int i = 0; i < maxn / 2; i++) {
    double ang = (2 * PI * i) / maxn;
    double _cos = cos(ang), _sin = sin(ang);
    W[i] = base(_cos, _sin);
    invW[i] = base(_cos, -_sin);
  }
}
void fft(vector<base>& a, bool invert) {
  int n = (int)a.size();
  for (int i = 1, j = 0; i < n; ++i) {
    int bit = n >> 1;
    for (; j >= bit; bit >>= 1) j -= bit;
    j += bit;
    if (i < j) swap(a[i], a[j]);
  }
  for (int len = 2; len <= n; len <<= 1) {
    for (int i = 0; i < n; i += len) {
      int ind = 0, add = maxn / len;
      for (int j = 0; j < len / 2; ++j) {
        base u = a[i + j],
             v = (a[i + j + len / 2] * (invert ? invW[ind] : W[ind]));
        a[i + j] = (u + v);
        a[i + j + len / 2] = (u - v);
        ind += add;
      }
    }
  }
  if (invert)
    for (int i = 0; i < n; ++i) a[i] /= n;
}
void multiply(vector<int>& a, vector<int>& B, long long mod) {
  vector<int> b = B;
  vector<base> fa(a.begin(), a.end()), fb(b.begin(), b.end());
  int fsz = a.size() + b.size() - 1;
  int n = 1;
  while (n < max(a.size(), b.size())) n <<= 1;
  n <<= 1;
  fa.resize(n), fb.resize(n);
  fft(fa, false), fft(fb, false);
  for (size_t i = 0; i < n; ++i) fa[i] *= fb[i];
  fft(fa, true);
  a.resize(fsz);
  for (int i = 0; i < fsz; i++) {
    long long temp = ((long long)(fa[i].real() + 0.5)) % mod;
    a[i] = (int)temp;
  }
}
int cnt[200005];
int arr[200005];
vector<int> go(int l, int r) {
  vector<int> res;
  res.clear();
  if (l == r) {
    res.push_back(1);
    while (cnt[arr[l]]--) res.push_back(1);
    return res;
  } else {
    int mid = (l + r) / 2;
    vector<int> v1 = go(l, mid);
    vector<int> v2 = go(mid + 1, r);
    multiply(v1, v2, 1009);
    return v1;
  }
}
int main() {
  precompute_powers();
  int n, m, k;
  cin >> n >> m >> k;
  srand(time(NULL));
  for (int i = 1; i <= n; i++) arr[i] = i;
  random_shuffle(arr + 1, arr + 1 + m);
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    cnt[x]++;
  }
  vector<int> res = go(1, m);
  cout << res[k] << "\n";
}
