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>
template <typename T>
inline void read(T &x) {
  char c;
  bool nega = 0;
  while ((!isdigit(c = getchar())) && (c != '-'))
    ;
  if (c == '-') {
    nega = 1;
    c = getchar();
  }
  x = c - 48;
  while (isdigit(c = getchar())) x = x * 10 + c - 48;
  if (nega) x = -x;
}
template <typename T>
inline void writep(T x) {
  if (x > 9) writep(x / 10);
  putchar(x % 10 + 48);
}
template <typename T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  writep(x);
  putchar(' ');
}
template <typename T>
inline void writeln(T x) {
  write(x);
  putchar('\n');
}
const long double Pi = acos(-1);
using namespace std;
using cd = complex<long double>;
const int MOD = 998244353;
int add(int a, int b) { return (a + b) % MOD; }
int sub(int a, int b) { return add(a, MOD - b); }
int mul(int a, int b) { return (1ll * a * b) % MOD; }
int power(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % MOD) {
    if (b & 1) {
      res = 1ll * res * a % MOD;
    }
  }
  return res;
}
int inv(int x) { return power(x, MOD - 2); }
struct NTT {
  int base = 1;
  int maxBase = 0;
  int root = 2;
  vector<int> w = {0, 1};
  vector<int> rev = {0, 1};
  NTT() {
    int u = MOD - 1;
    while (u % 2 == 0) {
      u >>= 1;
      maxBase++;
    }
    while (power(root, 1 << maxBase) != 1 ||
           power(root, 1 << (maxBase - 1)) == 1)
      root++;
  }
  void ensure(int curBase) {
    assert(curBase <= maxBase);
    if (curBase <= base) return;
    rev.resize(1 << curBase);
    for (int i = 0; i < (1 << curBase); i++) {
      rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (curBase - 1));
    }
    w.resize(1 << curBase);
    for (; base < curBase; base++) {
      int wc = power(root, 1 << (maxBase - base - 1));
      for (int i = 1 << (base - 1); i < (1 << base); i++) {
        w[i << 1] = w[i];
        w[i << 1 | 1] = mul(w[i], wc);
      }
    }
  }
  void fft(vector<int> &a) {
    int n = a.size();
    int curBase = 0;
    while ((1 << curBase) < n) curBase++;
    int shift = base - curBase;
    for (int i = 0; i < n; i++) {
      if (i < (rev[i] >> shift)) swap(a[i], a[rev[i] >> shift]);
    }
    for (int k = 1; k < n; k <<= 1) {
      for (int i = 0; i < k; i++) {
        for (int j = i; j < n; j += k * 2) {
          int foo = a[j];
          int bar = mul(a[j + k], w[i + k]);
          a[j] = add(foo, bar);
          a[j + k] = sub(foo, bar);
        }
      }
    }
  }
  vector<int> mult(vector<int> a, vector<int> b) {
    int nResult = a.size() + b.size() - 1;
    int curBase = 0;
    while ((1 << curBase) < nResult) curBase++;
    ensure(curBase);
    int n = 1 << curBase;
    a.resize(n), b.resize(n);
    fft(a);
    fft(b);
    int invN = inv(n);
    for (int i = 0; i < n; i++) {
      a[i] = mul(mul(a[i], b[i]), invN);
    }
    reverse(a.begin() + 1, a.end());
    fft(a);
    a.resize(nResult);
    return a;
  }
  vector<int> polyInv(vector<int> r, vector<int> f) {
    vector<int> foo = mult(r, f);
    foo.resize(f.size());
    foo[0] = sub(2, foo[0]);
    for (int i = 1; i < foo.size(); i++) {
      foo[i] = sub(0, foo[i]);
    }
    vector<int> res = mult(r, foo);
    res.resize(f.size());
    return res;
  }
} ntt;
int n, m, k, cnt[4000006];
priority_queue<pair<int, int> > heap;
vector<int> ans[4000006];
int main() {
  srand(time(NULL));
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie();
  if (fopen(".inp", "r")) freopen(".inp", "r", stdin);
  cin >> n >> m >> k;
  for (int i = (1); i <= (n); ++i) {
    int x;
    cin >> x;
    ++cnt[x];
  }
  for (int i = (1); i <= (m); ++i) {
    if (cnt[i]) {
      ans[i].resize(cnt[i] + 1, 1);
      heap.push(make_pair(-cnt[i], i));
    }
  }
  while (heap.size() > 1) {
    int u = -heap.top().first, idu = heap.top().second;
    heap.pop();
    int v = -heap.top().first, idv = heap.top().second;
    heap.pop();
    int de = u + v;
    int lim = 1;
    while (lim < de + 1) lim <<= 1;
    ans[idu].resize(lim);
    ans[idv].resize(lim);
    ans[idu] = ntt.mult(ans[idu], ans[idv]);
    for (int i = (0); i <= (lim - 1); ++i) {
      ans[idu][i] %= 1009;
    }
    heap.push(make_pair(-de, idu));
  }
  int id = heap.top().second;
  cout << ans[id][k] % 1009;
  return 0;
}
