#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
const long long M = 206158430209, G = 22;
inline long long mul(long long a, long long b) {
  long long ret = (a * b - (long long)((long double)a / M * b + 1e-6) * M);
  return ret < 0 ? ret + M : ret;
}
inline long long fp(long long x, long long y) {
  long long ret = 1;
  for (; y; y >>= 1, x = mul(x, x))
    if (y & 1) ret = mul(ret, x);
  return ret;
}
inline long long U(long long x) { return x < 0 ? x + M : x; }
inline long long D(long long x) { return x >= M ? x - M : x; }
const int P = 540000, N = 200010;
long long a[P], b[P], w[P];
int rev[P], n, m, k, num[N], cd;
vector<int> v[N];
void fft(long long *a, int n) {
  for (int i = 0; i < n; ++i)
    if (i > rev[i]) swap(a[i], a[rev[i]]);
  for (int i = 1; i < n; i <<= 1) {
    w[0] = 1;
    w[1] = fp(G, (M - 1) / (i << 1));
    for (int j = 2; j < i; ++j) w[j] = mul(w[j - 1], w[1]);
    for (int j = 0; j < n; j += (i << 1))
      for (int k = j; k < j + i; ++k) {
        long long x = a[k], y = mul(w[k - j], a[k + i]);
        a[k] = D(x + y);
        a[k + i] = U(x - y);
      }
  }
}
vector<int> operator*(const vector<int> &A, const vector<int> &B) {
  vector<int> ret(A.size() + B.size() - 1);
  size_t u, bit;
  for (u = 1, bit = 0; u < ret.size(); u <<= 1, ++bit)
    ;
  --bit;
  for (size_t i = 0; i < u; ++i) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << bit);
  for (size_t i = 0; i < A.size(); ++i) a[i] = A[i];
  memset(a + A.size(), 0, sizeof(*a) * (u - A.size()));
  for (size_t i = 0; i < B.size(); ++i) b[i] = B[i];
  memset(b + B.size(), 0, sizeof(*b) * (u - B.size()));
  fft(a, u);
  fft(b, u);
  for (size_t i = 0; i < u; ++i) a[i] = mul(a[i], b[i]);
  reverse(a + 1, a + u);
  fft(a, u);
  if ((int)ret.size() > k + 1) ret.resize(k + 1);
  long long ni = fp(u, M - 2);
  for (size_t i = 0; i < ret.size(); ++i) ret[i] = mul(a[i], ni) % 1009;
  return ret;
}
struct cmp {
  bool operator()(const int &a, const int &b) {
    return v[a].size() > v[b].size();
  }
};
int main() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1, x; i <= n; ++i) {
    scanf("%d", &x);
    ++num[x];
  }
  priority_queue<int, vector<int>, cmp> s;
  for (int i = 1; i <= m; ++i)
    if (num[i]) {
      v[++cd].resize(num[i] + 1);
      for (size_t j = 0; j < v[cd].size(); ++j) v[cd][j] = 1;
      s.push(cd);
    }
  while (s.size() > 1) {
    int x = s.top();
    s.pop();
    int y = s.top();
    s.pop();
    if (x > y) swap(x, y);
    v[x] = v[x] * v[y];
    s.push(x);
  }
  if ((int)v[1].size() > k)
    printf("%d", v[1][k]);
  else
    putchar('0');
}
