10 2 5
1 1 1 2 2 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 2 2 2 2
 3 3 2
1 3 1
 8 8 7
7 2 8 6 8 5 3 8
 7 7 5
2 6 3 6 3 5 1
 5 5 1
5 2 5 1 2
 6 6 6
5 6 5 3 4 2
 5 5 2
2 3 2 2 4
 3 3 3
1 1 1
 111 78 54
24 13 49 22 52 38 38 63 21 10 9 56 60 47 11 78 23 52 55 12 72 33 17 14 33 59 21 32 20 73 1 60 27 64 23 74 36 49 69 14 29 37 19 61 52 33 26 27 10 11 34 25 62 47 36 12 63 45 31 71 78 1 6 26 36 65 56 46 19 28 77 64 56 8 77 38 3 33 63 77 40 7 22 13 60 14 57 43 51 10 30 21 7 67 32 11 12 9 72 24 27 67 25 63 6 67 69 37 26 19 26
 10 2 5
1 1 1 1 1 1 1 1 1 2
 6 6 1
4 5 6 3 5 3
 10 2 5
1 1 1 1 2 2 2 2 2 2
 8 8 3
8 8 2 7 8 2 3 5
 7 7 4
4 6 6 7 2 5 3
 10 2 5
2 2 2 2 2 2 2 2 2 2
 111 67 97
32 67 4 15 17 17 23 6 39 54 19 62 28 59 63 36 44 40 28 67 28 3 55 19 11 26 3 38 22 26 62 54 61 15 22 4 47 53 27 36 31 5 16 59 51 62 51 46 7 55 26 66 50 51 32 17 54 14 18 14 40 30 24 2 61 16 16 27 55 58 35 7 26 3 26 4 13 59 14 32 56 54 5 46 39 30 45 24 37 12 67 38 45 32 41 21 46 26 41 29 15 28 65 5 19 53 13 31 58 18 57
 6 6 2
4 4 2 4 2 3
 10 2 5
1 1 1 1 1 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 1 1 2 2
 6 6 4
5 2 4 3 1 5
 10 2 5
1 1 2 2 2 2 2 2 2 2
 1 1 1
1
 8 8 5
7 5 6 8 2 8 3 4
 10 2 5
1 1 1 1 1 1 1 2 2 2
 111 101 52
54 69 33 81 8 90 48 21 96 35 44 75 68 34 101 82 93 94 86 76 33 91 5 70 22 84 70 71 62 81 50 83 51 43 95 46 19 53 101 34 51 40 6 17 69 60 73 89 65 75 59 68 62 49 89 23 63 83 86 68 62 39 1 18 3 75 44 57 9 24 67 81 83 45 93 66 79 71 43 49 17 2 33 38 98 71 71 21 56 16 31 2 75 61 64 38 69 80 81 12 68 95 26 9 69 82 41 35 75 7 71
 3 3 3
3 3 1
 4 4 2
2 4 4 3
 10 2 5
1 2 2 2 2 2 2 2 2 2
 4 4 4
4 4 4 4
 3 3 2
1 2 3
 2 1 2
1 1
 5 5 3
3 4 1 5 5
 7 7 1
2 6 5 6 2 3 3
 111 9 57
9 9 2 6 8 6 5 8 9 7 3 9 1 2 6 6 5 3 1 1 6 1 8 4 3 9 8 6 8 1 9 8 5 8 6 9 4 5 7 3 1 6 4 3 2 5 7 3 1 7 9 1 7 1 3 5 9 5 6 2 2 7 9 7 1 5 5 5 5 2 6 5 7 3 8 9 7 3 6 5 1 9 2 9 9 8 8 7 9 1 6 2 4 5 7 4 8 9 9 2 7 7 6 9 8 2 1 3 3 1 5
 4 4 1
2 4 1 4
 2 1 1
1 1
 111 16 58
15 6 4 7 7 10 16 2 3 1 4 8 10 1 2 11 6 6 14 16 6 16 1 2 13 2 7 13 1 4 1 4 12 2 4 11 15 12 9 13 10 4 11 7 5 3 12 11 11 3 16 15 9 6 15 11 4 14 8 15 16 3 9 10 9 1 8 4 14 7 13 5 1 8 5 11 8 14 1 8 15 2 5 2 4 5 9 2 10 11 11 5 7 11 11 14 5 16 14 2 4 11 12 10 7 14 2 5 3 2 1
 2 2 2
1 1

4
 5
 2
 6
 12
 3
 1
 4
 1
 648
 2
 4
 5
 19
 25
 1
 214
 5
 6
 3
 11
 3
 1
 41
 4
 881
 1
 4
 2
 1
 3
 1
 7
 4
 446
 3
 1
 552
 1

#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MAXN = 3e5 + 50;
const long long LINF = 0x3f3f3f3f3f3f3f3f, MOD = 1009;
const double Pi = acos(-1), EPS = 1e-6;
void test() { cerr << "\n"; }
template <typename T, typename... Args>
void test(T x, Args... args) {
  cerr << x << " ";
  test(args...);
}
inline long long qpow(long long a, long long b) {
  return b ? ((b & 1) ? a * qpow(a * a % MOD, b >> 1) % MOD
                      : qpow(a * a % MOD, b >> 1)) %
                 MOD
           : 1;
}
inline long long qpow(long long a, long long b, long long c) {
  return b ? ((b & 1) ? a * qpow(a * a % c, b >> 1, c) % c
                      : qpow(a * a % c, b >> 1, c)) %
                 c
           : 1;
}
inline long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline long long cede(long long a, long long b) {
  if (b < 0) return cede(-a, -b);
  if (a < 0) return a / b;
  return (a + b - 1) / b;
}
inline long long flde(long long a, long long b) {
  if (b < 0) return flde(-a, -b);
  if (a < 0) return (a - b + 1) / b;
  return a / b;
}
inline int sign(double x) { return x < -EPS ? -1 : x > EPS; }
inline int dbcmp(double l, double r) { return sign(l - r); }
namespace Fast_IO {
const int MAXL((1 << 18) + 1);
int iof, iotp;
char ioif[MAXL], *ioiS, *ioiT, ioof[MAXL],
    *iooS = ioof, *iooT = ioof + MAXL - 1, ioc, iost[55];
char Getchar() {
  if (ioiS == ioiT) {
    ioiS = ioif;
    ioiT = ioiS + fread(ioif, 1, MAXL, stdin);
    return (ioiS == ioiT ? EOF : *ioiS++);
  } else
    return (*ioiS++);
}
void Write() {
  fwrite(ioof, 1, iooS - ioof, stdout);
  iooS = ioof;
}
void Putchar(char x) {
  *iooS++ = x;
  if (iooS == iooT) Write();
}
inline int read() {
  int x = 0;
  for (iof = 1, ioc = Getchar(); (ioc < '0' || ioc > '9') && ioc != EOF;)
    iof = ioc == '-' ? -1 : 1, ioc = Getchar();
  if (ioc == EOF) Write(), exit(0);
  for (x = 0; ioc <= '9' && ioc >= '0'; ioc = Getchar())
    x = (x << 3) + (x << 1) + (ioc ^ 48);
  return x * iof;
}
inline long long read_ll() {
  long long x = 0;
  for (iof = 1, ioc = Getchar(); (ioc < '0' || ioc > '9') && ioc != EOF;)
    iof = ioc == '-' ? -1 : 1, ioc = Getchar();
  if (ioc == EOF) Write(), exit(0);
  for (x = 0; ioc <= '9' && ioc >= '0'; ioc = Getchar())
    x = (x << 3) + (x << 1) + (ioc ^ 48);
  return x * iof;
}
void Getstr(char *s, int &l) {
  for (ioc = Getchar(); ioc == ' ' || ioc == '\n' || ioc == '\t';)
    ioc = Getchar();
  if (ioc == EOF) Write(), exit(0);
  for (l = 0; !(ioc == ' ' || ioc == '\n' || ioc == '\t' || ioc == EOF);
       ioc = Getchar())
    s[l++] = ioc;
  s[l] = 0;
}
template <class Int>
void Print(Int x, char ch = '\0') {
  if (!x) Putchar('0');
  if (x < 0) Putchar('-'), x = -x;
  while (x) iost[++iotp] = x % 10 + '0', x /= 10;
  while (iotp) Putchar(iost[iotp--]);
  if (ch) Putchar(ch);
}
void Putstr(const char *s) {
  for (int i = 0, n = strlen(s); i < n; ++i) Putchar(s[i]);
}
}  // namespace Fast_IO
using namespace Fast_IO;
namespace DXS {
struct CP {
  long double x, y;
  CP(long double xx = 0, long double yy = 0) {
    x = xx;
    y = yy;
  }
  CP operator+(const CP &b) { return CP(x + b.x, y + b.y); }
  CP operator-(const CP &b) { return CP(x - b.x, y - b.y); }
  CP operator*(const CP &b) { return CP(x * b.x - y * b.y, x * b.y + y * b.x); }
};
const int G = 3, Gi = 332748118;
int bit = 0, lim = 1;
int rev[MAXN];
int init(int N) {
  lim = 1, bit = 0;
  while (lim < N) lim <<= 1, bit++;
  for (int i = 0; i < lim; i++)
    rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (bit - 1));
  return lim;
}
void NTT(int *A, int lim, int inv) {
  for (int i = 0; i < lim; i++)
    if (i < rev[i]) swap(A[i], A[rev[i]]);
  for (int mid = 1; mid < lim; mid <<= 1) {
    int W = qpow(inv == 1 ? G : Gi, (MOD - 1) / (mid << 1));
    for (int j = 0; j < lim; j += (mid << 1)) {
      int w = 1;
      for (int k = 0; k < mid; k++, w = 1ll * w * W % MOD) {
        int x = A[j + k], y = 1ll * w * A[j + k + mid] % MOD;
        A[j + k] = (x + y) % MOD;
        A[j + k + mid] = (x - y + MOD) % MOD;
      }
    }
  }
  if (inv == -1)
    for (int i = 0, iv = qpow(lim, MOD - 2); i < lim; i++)
      A[i] = 1ll * iv * A[i] % MOD;
}
void FFT(CP *A, int lim, int inv) {
  for (int i = 0; i < lim; i++)
    if (i < rev[i]) swap(A[i], A[rev[i]]);
  for (int mid = 1; mid < lim; mid <<= 1) {
    CP XX(cos(Pi / mid), inv * sin(Pi / mid));
    for (int j = 0; j < lim; j += (mid << 1)) {
      CP w(1, 0);
      for (int k = 0; k < mid; k++, w = w * XX) {
        CP x = A[j + k], y = w * A[j + mid + k];
        A[j + k] = x + y;
        A[j + mid + k] = x - y;
      }
    }
  }
  if (inv == -1)
    for (int i = 0; i < lim; i++) A[i].x /= lim;
}
void Getdev(int *A, int *B, int n) {
  for (int i = 0; i < n - 1; ++i) B[i] = 1ll * A[i + 1] * (i + 1) % MOD;
}
void Getint(int *A, int *B, int n) {
  for (int i = n; i >= 1; --i) B[i] = 1ll * A[i - 1] * qpow(i, MOD - 2) % MOD;
  B[0] = 0;
}
void Rightshift(int *A, int *B, int n, int k) {
  for (int i = n - 1; i >= k; --i) B[i] = A[i - k];
  for (int i = 0; i < min(k, n); i++) B[i] = 0;
}
void Leftshift(int *A, int *B, int n, int k) {
  for (int i = n - k - 1; i >= 0; --i) B[i] = A[i + k];
  for (int i = n - 1; i >= max(0, n - k); i--) B[i] = 0;
}
void mulC(int *A, int n, int c) {
  for (int i = 0; i < n; i++) A[i] = 1ll * A[i] * c % MOD;
}
void mul(int *A, int *B, int *C, int n, int m) {
  int len = init(n + m);
  NTT(A, len, 1);
  if (A != B) NTT(B, len, 1);
  for (int i = 0; i < len; i++) C[i] = 1ll * A[i] * B[i] % MOD;
  NTT(C, len, -1);
}
}  // namespace DXS
int cnt[MAXN];
struct PNode {
  int val, id;
  bool operator<(const PNode &R) const { return val > R.val; }
};
priority_queue<PNode> pq;
vector<int> ve[MAXN];
DXS::CP a[MAXN], b[MAXN];
int toint(long double x, int M) {
  long long k = (x + EPS) / M;
  x -= k * M;
  return x + 2 * EPS;
}
void merge(int id1, int id2) {
  int maxv = ve[id1].size() + ve[id2].size() - 1;
  for (int i = 0; i < maxv + maxv + 2; i++) a[i] = b[i] = {0, 0};
  for (int i = 0; i < ve[id1].size(); i++) a[i].x = ve[id1][i];
  for (int i = 0; i < ve[id2].size(); i++) b[i].x = ve[id2][i];
  int len = DXS::init(maxv + 1);
  DXS::FFT(a, len, 1);
  DXS::FFT(b, len, 1);
  for (int i = 0; i < len; i++) a[i] = a[i] * b[i];
  DXS::FFT(a, len, -1);
  ve[id1].clear();
  ve[id2].clear();
  for (int i = 0; i < maxv; i++) ve[id1].push_back(toint(a[i].x, (int)MOD));
}
int fac[MAXN], invfac[MAXN];
void init() {
  fac[0] = 1;
  for (int i = 1; i < MAXN; i++) fac[i] = 1ll * fac[i - 1] * i % MOD;
  invfac[MAXN - 1] = qpow(fac[MAXN - 1], MOD - 2);
  for (int i = MAXN - 2; i >= 0; --i)
    invfac[i] = 1ll * invfac[i + 1] * (i + 1) % MOD;
}
void work() {
  int n = read(), m = read(), k = read();
  for (int i = 1; i <= n; i++) {
    int x = read();
    cnt[x]++;
  }
  int cntS = 0;
  for (int i = 1; i <= m; i++) {
    if (!cnt[i]) continue;
    ++cntS;
    for (int j = 0; j <= cnt[i]; j++) ve[cntS].push_back(1);
    pq.push({(int)ve[cntS].size(), cntS});
  }
  while (pq.size() > 1) {
    PNode tmp1 = pq.top();
    pq.pop();
    PNode tmp2 = pq.top();
    pq.pop();
    merge(tmp1.id, tmp2.id);
    pq.push({(int)ve[tmp1.id].size(), tmp1.id});
  }
  printf("%d\n", ve[pq.top().id][k]);
}
int main() {
  init();
  work();
}
