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, lgn = 20;
const int mod = 1009;
inline int pow_mod(int x, int n) {
  int y = 1;
  while (n) {
    if (n & 1) y = (long long)y * x % mod;
    x = (long long)x * x % mod;
    n >>= 1;
  }
  return y;
}
namespace Poly {
struct comp {
  double r, i;
  comp() {}
  comp(double r, double i) : r(r), i(i) {}
} w[lgn][maxn];
comp operator*(const comp &a, const comp &b) {
  return comp(a.r * b.r - a.i * b.i, a.r * b.i + a.i * b.r);
}
comp operator+(const comp &a, const comp &b) {
  return comp(a.r + b.r, a.i + b.i);
}
comp operator-(const comp &a, const comp &b) {
  return comp(a.r - b.r, a.i - b.i);
}
comp conj(const comp &a) { return comp(a.r, -a.i); }
void init() {
  static const double pi = acos(-1);
  for (int i = 0; i < lgn; ++i) {
    int n = 1 << i;
    if (n >= maxn) break;
    for (int j = 0; j < n; ++j) {
      if (i && (~j & 1))
        w[i][j] = w[i - 1][j >> 1];
      else {
        double ang = 2. * pi * j / (double)n;
        w[i][j] = comp(cos(ang), sin(ang));
      }
    }
  }
  return;
}
inline int toint(double x, double invn) { return llround(x * invn) % mod; }
void dft(int n, comp *a) {
  for (int i = 0, j = 0; i < n; ++i) {
    if (i < j) swap(a[i], a[j]);
    for (int k = n >> 1; (j ^= k) < k; k >>= 1)
      ;
  }
  for (int hl = 1, l = 2, wi = 1; l <= n; hl = l, l <<= 1, ++wi)
    for (int i = 0; i < n; i += l) {
      comp *x = a + i, *y = x + hl, *z = w[wi];
      for (int j = 0; j < hl; ++j, ++x, ++y, ++z) {
        comp t = *y * *z;
        *y = *x - t;
        *x = *x + t;
      }
    }
  return;
}
struct poly {
  vector<int> p;
  poly() { p.clear(); }
  poly(const vector<int> &q) : p(q) {}
  poly(int n, int *a) {
    p.resize(n);
    for (int i = 0; i < n; ++i) p[i] = a[i];
  }
  inline int size() const { return p.size(); }
  inline void resize(int n) {
    p.resize(n);
    return;
  }
};
poly operator*(const poly &A, const poly &B) {
  int n = A.size(), m = B.size();
  if (n < 10 || m < 10 || n + m - 1 < 80) {
    int N = n + m - 1;
    static int c[maxn];
    memset(c, 0, sizeof(c[0]) * N);
    for (int i = 0; i < n; ++i)
      for (int x = A.p[i], j = 0; j < m; ++j)
        c[i + j] = ((long long)x * B.p[j] + c[i + j]) % mod;
    return poly(N, c);
  }
  int N = 1;
  while (N < n + m - 1) N <<= 1;
  static comp a[maxn], b[maxn], da[maxn], db[maxn], dc[maxn], dd[maxn];
  for (int i = 0; i < n; ++i) {
    int x = (A.p[i] + mod) % mod;
    a[i] = comp(x & 32767, x >> 15);
  }
  for (int i = n; i < N; ++i) a[i] = comp(0, 0);
  for (int i = 0; i < m; ++i) {
    int x = (B.p[i] + mod) % mod;
    b[i] = comp(x & 32767, x >> 15);
  }
  for (int i = m; i < N; ++i) b[i] = comp(0, 0);
  dft(N, a);
  dft(N, b);
  for (int i = 0; i < N; ++i) {
    int j = N - i & N - 1;
    static comp DA, DB, DC, DD;
    DA = (a[i] + conj(a[j])) * comp(.5, 0);
    DB = (a[i] - conj(a[j])) * comp(0, -.5);
    DC = (b[i] + conj(b[j])) * comp(.5, 0);
    DD = (b[i] - conj(b[j])) * comp(0, -.5);
    da[j] = DA * DC;
    db[j] = DA * DD;
    dc[j] = DB * DC;
    dd[j] = DB * DD;
  }
  for (int i = 0; i < N; ++i)
    a[i] = da[i] + db[i] * comp(0, 1), b[i] = dc[i] + dd[i] * comp(0, 1);
  dft(N, a);
  dft(N, b);
  double iN = 1.0 / N;
  N = n + m - 1;
  static int c[maxn];
  for (int i = 0; i < N; ++i) {
    static int da, db, dc, dd;
    da = toint(a[i].r, iN), db = toint(a[i].i, iN), dc = toint(b[i].r, iN),
    dd = toint(b[i].i, iN);
    c[i] = (((long long)dd << 30) + ((long long)db + dc << 15) + da) % mod;
  }
  return poly(N, c);
}
poly operator*(const int &a, const poly &B) {
  static int b[maxn];
  int n = B.size();
  for (int i = 0; i < n; ++i) b[i] = (long long)a * B.p[i] % mod;
  return poly(n, b);
}
poly operator-(const poly &A, const poly &B) {
  static int a[maxn];
  int n = A.size(), m = B.size(), N = max(n, m);
  for (int i = 0; i < N; ++i)
    a[i] = ((i < n ? A.p[i] : 0) - (i < m ? B.p[i] : 0)) % mod;
  return poly(N, a);
}
poly operator+(const poly &A, const poly &B) {
  static int a[maxn];
  int n = A.size(), m = B.size(), N = max(n, m);
  for (int i = 0; i < N; ++i)
    a[i] = ((i < n ? A.p[i] : 0) + (i < m ? B.p[i] : 0)) % mod;
  return poly(N, a);
}
poly inv(int n, const poly &A) {
  if (n == 1) {
    return poly(vector<int>{pow_mod(A.p[0], mod - 2)});
  }
  static poly B0, B, tA;
  B0 = inv(n + 1 >> 1, A);
  if (A.size() < n)
    tA = A, tA.resize(n);
  else
    tA.p.clear(), tA.p.insert(tA.p.end(), A.p.begin(), A.p.begin() + n);
  B = 2 * B0 - B0 * B0 * tA;
  B.resize(n);
  return B;
}
poly rev(const poly &A) {
  static poly B;
  B = A;
  reverse(B.p.begin(), B.p.end());
  return B;
}
poly operator/(const poly &A, const poly &B) {
  static poly rA, rB, C, D;
  int n = A.size(), m = B.size();
  rA = rev(A);
  rB = rev(B);
  C = inv(n - m + 1, rB);
  D = C * rA;
  D.resize(n - m + 1);
  return rev(D);
}
poly operator%(const poly &A, const poly &B) {
  static poly D, ret;
  D = A / B;
  ret = A - B * D;
  ret.resize(B.size() - 1);
  return ret;
}
poly Rem(const poly &A, const poly &B, const poly &D) {
  static poly ret;
  ret = A - B * D;
  ret.resize(B.size() - 1);
  return ret;
}
poly dao(const poly &A) {
  static int a[maxn];
  int n = A.size() - 1;
  for (int i = 0; i < n; ++i) a[i] = (long long)A.p[i + 1] * (i + 1) % mod;
  return poly(n, a);
}
poly ji(const poly &A) {
  static int a[maxn];
  int n = A.size();
  for (int i = 1; i <= n; ++i)
    a[i] = (long long)A.p[i - 1] * pow_mod(i, mod - 2) % mod;
  a[0] = 0;
  return poly(n + 1, a);
}
poly ln(int n, const poly &A) {
  static poly B, C;
  C = dao(A);
  B = inv(n, A);
  B = B * C;
  B = ji(B);
  B.resize(n);
  return B;
}
poly exp(int n, const poly &A) {
  if (n == 1) {
    return poly(vector<int>{1});
  }
  static poly B0, B, C, tA;
  B0 = exp(n + 1 >> 1, A);
  if (A.size() < n)
    tA = A, tA.resize(n);
  else
    tA.p.clear(), tA.p.insert(tA.p.end(), A.p.begin(), A.p.begin() + n);
  C = ln(n, B0);
  B = B0 * (poly(vector<int>{1}) - C + tA);
  B.resize(n);
  return B;
}
poly pow_mod(int n, const poly &A, int N) {
  static poly B;
  int na = A.size(), i = 0;
  while (i < na && A.p[i] == 0) ++i;
  if (i == na || (long long)N * i >= n) return poly(vector<int>(n, 0));
  if (i) {
    B.p.clear();
    for (int j = i; j < na; ++j) B.p.push_back(A.p[j]);
    static poly C;
    C = pow_mod(n - N * i, B, N);
    B.p = vector<int>(N * i, 0);
    B.p.insert(B.p.end(), C.p.begin(), C.p.end());
    return B;
  }
  if (A.p[0] != 1) {
    int t = ::pow_mod(A.p[0], mod - 2), s = ::pow_mod(A.p[0], N);
    B.resize(na);
    for (int i = 0; i < na; ++i) B.p[i] = (long long)A.p[i] * t % mod;
    B = pow_mod(n, B, N);
    for (int i = 0; i < n; ++i) B.p[i] = (long long)s * B.p[i] % mod;
    return B;
  }
  B = ln(n, A);
  for (int i = 0; i < n; ++i) B.p[i] = (long long)B.p[i] * N % mod;
  return exp(n, B);
}
}  // namespace Poly
using namespace Poly;
int a[maxn], n, m, k;
vector<poly> v;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  init();
  for (int x, i = 1; i <= n; ++i) scanf("%d", &x), ++a[x];
  sort(a + 1, a + m + 1);
  reverse(a + 1, a + m + 1);
  for (int x = 1; x <= m; ++x)
    if (a[x]) {
      poly p;
      for (int i = 0; i <= a[x]; ++i) p.p.push_back(1);
      v.push_back(p);
      while (v.size() >= 2 && v.back().p.size() >= v[v.size() - 2].size()) {
        auto t = v.back();
        v.pop_back();
        v.back() = v.back() * t;
      }
    }
  while (v.size() >= 2) {
    auto t = v.back();
    v.pop_back();
    v.back() = v.back() * t;
  }
  printf("%d\n", (v[0].p[k] + mod) % mod);
  return 0;
}
