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 maxn = (1 << 19) | 10, mod = 1009;
const double pi = acos(-1);
inline int lowbit(const int &i) { return i & (-i); }
inline int getpw2(int n) {
  while (__builtin_popcount(n) > 1) {
    n += lowbit(n);
  }
  return n;
}
inline int pow_mod(int x, int n) {
  int y = 1;
  while (n) {
    if (n & 1) {
      y = 1ll * x * y % mod;
    }
    x = 1ll * x * x % mod;
    n >>= 1;
  }
  return y;
}
struct comp {
  double r, i;
  comp() { r = i = 0; }
  comp(int x) {
    r = (double)x;
    i = 0;
  }
  comp(double r, double i) : r(r), i(i) {}
  comp operator+(const comp &a) const { return comp(r + a.r, i + a.i); }
  comp operator-(const comp &a) const { return comp(r - a.r, i - a.i); }
  comp operator*(const comp &a) const {
    return comp(r * a.r - i * a.i, r * a.i + i * a.r);
  }
  comp operator/(const int &x) { return comp(r / (double)x, i / (double)x); }
} wn[20][maxn];
int gpw2[maxn];
void init() {
  for (int i = 0, l = 1; l < maxn; l <<= 1, ++i) {
    double T = pi / l;
    for (register int j = 0; j < l; ++j) {
      wn[i][j] = comp(cos(j * T), sin(j * T));
    }
  }
  for (int i = 1; i < maxn; ++i) {
    gpw2[i] = getpw2(i);
  }
  return;
}
void dft(int n, comp *a) {
  for (register int i = 0, j = 0; i < n; ++i) {
    if (j < i) {
      std::swap(a[i], a[j]);
    }
    for (int k = n >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  for (int hl = 1, l = 2, t = 0; l <= n; hl = l, l <<= 1, ++t) {
    for (int i = 0; i < n; i += l) {
      comp *beg = a + i, *ww = wn[t];
      for (int j = 0; j < hl; ++j) {
        comp w = ww[j], t = beg[j | hl] * w;
        beg[j | hl] = beg[j] - t;
        beg[j] = beg[j] + t;
      }
    }
  }
  return;
}
inline int toint(const double &x) { return (long long)(x + .5) % mod; }
inline comp conj(const comp &x) { return comp(x.r, -x.i); }
void mul(int n, int *a, int m, int *b, int *c) {
  int N = gpw2[n + m - 1];
  static comp A[maxn], B[maxn], C[maxn], D[maxn];
  for (int i = 0; i < n; ++i) {
    (a[i] < 0) && (a[i] += mod);
    A[i] = comp(a[i] & 32767, a[i] >> 15);
  }
  for (int i = 0; i < m; ++i) {
    (b[i] < 0) && (b[i] += mod);
    B[i] = comp(b[i] & 32767, b[i] >> 15);
  }
  for (int i = n; i < N; ++i) {
    A[i] = comp(0);
  }
  for (int i = m; i < N; ++i) {
    B[i] = comp(0);
  }
  dft(N, A);
  dft(N, B);
  for (int i = 0; i < N; ++i) {
    int j = N - 1 & N - i;
    comp a = (A[i] + conj(A[j])) * comp(.5, 0),
         b = (A[i] - conj(A[j])) * comp(0, -.5),
         c = (B[i] + conj(B[j])) * comp(.5, 0),
         d = (B[i] - conj(B[j])) * comp(0, -.5);
    C[j] = a * c + a * d * comp(0, 1);
    D[j] = b * c + b * d * comp(0, 1);
  }
  dft(N, C);
  dft(N, D);
  double M = 1. / N;
  for (int i = 0; i < n + m - 1; ++i) {
    int w = toint(C[i].r * M), x = toint(C[i].i * M), y = toint(D[i].r * M),
        z = toint(D[i].i * M);
    c[i] = (((long long)z << 30) + ((long long)(x + y) << 15) + w) % mod;
  }
  return;
}
void inv(int n, int *a, int *r) {
  int N = gpw2[n];
  static int b[maxn], c[maxn];
  b[0] = pow_mod(a[0], mod - 2);
  for (int hl = 1, l = 2; l <= N; hl = l, l <<= 1) {
    mul(hl, b, hl, b, c);
    mul(l - 1, c, l, a, c);
    for (register int i = 0; i < hl; ++i) {
      b[i] = (2ll * b[i] - c[i]) % mod;
    }
    for (register int i = hl; i < l; ++i) {
      b[i] = -c[i];
    }
  }
  memcpy(r, b, sizeof(int) * n);
  return;
}
int *v[maxn], top, len[maxn];
int b[maxn], c[maxn], a[maxn], x[maxn];
int n, m, k;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  while (n--) {
    int x;
    scanf("%d", &x);
    ++a[x];
  }
  init();
  for (int i = 1; i <= m; ++i) {
    if (a[i]) {
      v[top] = new int[a[i] + 1];
      for (int j = 0; j <= a[i]; ++j) {
        v[top][j] = 1;
      }
      len[top++] = a[i] + 1;
      while (top > 1 && len[top - 1] >= len[top - 2]) {
        --top;
        mul(len[top - 1], v[top - 1], len[top], v[top], x);
        len[top - 1] += len[top];
        delete v[top];
        delete v[top - 1];
        v[top - 1] = new int[len[top - 1]];
        memcpy(v[top - 1], x, sizeof(int) * len[top - 1]);
      }
    }
  }
  while (top > 1) {
    --top;
    mul(len[top - 1], v[top - 1], len[top], v[top], x);
    len[top - 1] += len[top];
    delete v[top];
    delete v[top - 1];
    v[top - 1] = new int[len[top - 1]];
    memcpy(v[top - 1], x, sizeof(int) * len[top - 1]);
  }
  printf("%d\n", v[0][k]);
  return 0;
}
