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 mod = 1009;
namespace fft {
const int L = 18, FN = (1 << L);
int rev[FN];
const double pi = 3.1415926535897932384626433832795028841971l;
const double two_pi = pi * 2;
struct cp {
  double x, y;
  cp() {}
  cp(double _x) : x(_x), y(0) {}
  cp(double _x, double _y) : x(_x), y(_y) {}
  inline cp operator+(const cp &p) const { return cp(x + p.x, y + p.y); }
  inline cp operator-(const cp &p) const { return cp(x - p.x, y - p.y); }
  inline cp operator*(const cp &p) const {
    return cp(x * p.x - y * p.y, x * p.y + y * p.x);
  }
  inline cp operator!() const { return cp(x, -y); }
} nw[FN + 1], f[FN], g[FN], h[FN], hh[FN];
void init() {
  rev[0] = 0;
  for (int i = 1; i < FN; i++)
    rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (L - 1));
  nw[0] = nw[FN] = cp(1, 0);
  for (int i = 1; i <= (FN >> 1); i++)
    nw[i] = cp(cos(i * two_pi / FN), sin(i * two_pi / FN));
  for (int i = (FN >> 1) + 1; i < FN; i++) nw[i] = !nw[FN - i];
}
void dft(cp *a, int n, int fg) {
  int d = __builtin_ctz(FN / n);
  for (int i = 0; i < n; i++)
    if (i < (rev[i] >> d)) swap(a[i], a[rev[i] >> d]);
  for (int size = 2; size <= n; size <<= 1) {
    int step = FN / size;
    if (fg) step = -step;
    for (int i = 0; i < n; i += size) {
      cp *u = a + i, *v = a + (i + (size >> 1)), *w = fg ? nw + FN : nw;
      for (int k = (size >> 1); k--;) {
        cp tmp = (*v) * (*w);
        *v = *u - tmp, *u = *u + tmp;
        u++, v++, w += step;
      }
    }
  }
  if (fg)
    for (int i = 0; i < n; i++) a[i].x /= n, a[i].y /= n;
}
void multiply(vector<int> &a, vector<int> &b, vector<int> &c) {
  int n1 = a.size(), n2 = b.size(), n = 1;
  while (n <= n1 + n2) n <<= 1;
  for (int i = 0; i < n; i++) {
    f[i] = cp((double)(i < n1 ? a[i] : 0));
    g[i] = cp((double)(i < n2 ? b[i] : 0));
  }
  dft(f, n, 0);
  dft(g, n, 0);
  for (int i = 0; i < n; i++) {
    h[i] = f[i] * g[i];
  }
  dft(h, n, 1);
  c.resize(n1 + n2 - 1);
  for (int i = 0; i < c.size(); i++) c[i] = ((long long)(h[i].x + 0.5)) % mod;
}
}  // namespace fft
int n, m, k;
int a[202020];
void solve(int st, int en, vector<int> &z) {
  z.clear();
  if (a[st] == a[en]) {
    z.resize(en - st + 2, 1);
    return;
  }
  int mid = (st + en) >> 1;
  if (a[mid] != a[en]) {
    while (a[mid] == a[mid + 1]) mid++;
  } else {
    while (a[mid] == a[mid + 1]) mid--;
  }
  vector<int> x, y;
  solve(st, mid, x);
  solve(mid + 1, en, y);
  fft::multiply(x, y, z);
}
vector<int> answer;
int main() {
  fft::init();
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  solve(1, n, answer);
  printf("%d\n", answer[k]);
  return 0;
}
