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 long long mod = 998244353;
const long long hat2 = (mod - 1) / 119;
long long recN, root, N, M, K, a, tart;
int roots[hat2];
int ft[hat2];
int rev[hat2];
int fi[hat2];
int db[200001];
vector<int> pp, qq, PQ;
vector<int> d[5000000];
long long unitRoot(long long x, long long y) {
  y = hat2 / y;
  if (x < 0) x = (x + hat2) % hat2;
  return roots[(x * y) % hat2];
}
long long hat(long long x, long long y) {
  x %= mod;
  y %= (mod - 1);
  long long help = 1;
  for (int i = 0; (1 << i) <= y; i++) {
    if ((1 << i) & y) help = (help * x) % mod;
    x = (x * x) % mod;
  }
  return help;
}
long long rec(long long x) { return hat(x, mod - 2); }
void fft(vector<int>& pre, long long n, int FFT, vector<int>& target) {
  if (n > hat2) cout << 5 / 0 << endl;
  int id = 0;
  while ((1 << id) != n) id++;
  for (int i = 0; i < n; i++) {
    ft[i] = 0;
    int place = 0;
    for (int j = 0; (1 << j) <= i; j++) {
      if ((1 << j) & i) place |= (1 << (id - j - 1));
    }
    rev[i] = place;
  }
  int num = 0;
  for (int i : pre) {
    ft[rev[num]] = i;
    num++;
  }
  for (int i = 1; i <= id; i++) {
    for (int j = 0; j < (1 << (i - 1)); j++)
      fi[j] = unitRoot(-j * FFT, (1 << i));
    for (int j = 0; j < n; j += (1 << i)) {
      for (int k = j; k < j + (1 << (i - 1)); k++) {
        long long aa = ft[k];
        long long bb = ft[k + (1 << (i - 1))];
        long long cc = fi[k - j];
        bb = (bb * cc) % mod;
        cc = (aa + bb) % mod;
        ft[k] = cc;
        cc = (aa - bb + mod) % mod;
        ft[k + (1 << (i - 1))] = cc;
      }
    }
  }
  target.resize(n);
  recN = rec(n);
  for (int i = 0; i < n; i++) {
    long long cc = ft[i];
    if (FFT == -1) cc = (cc * recN) % mod;
    target[i] = cc;
  }
}
void mul(vector<int>& P, vector<int>& Q, vector<int>& target) {
  while (P.back() == 0) P.pop_back();
  while (Q.back() == 0) Q.pop_back();
  int fokP = P.size() - 1;
  int fokQ = Q.size() - 1;
  int maxN = 1;
  while (fokP + fokQ + 1 > maxN) maxN *= 2;
  fft(P, maxN, 1, pp);
  fft(Q, maxN, 1, qq);
  auto itPP = pp.begin();
  auto itQQ = qq.begin();
  PQ.resize(maxN);
  for (int i = 0; i < maxN; i++, itPP++, itQQ++) {
    long long c1 = (*itPP);
    long long c2 = (*itQQ);
    c1 = (c1 * c2) % mod;
    PQ[i] = c1;
  }
  fft(PQ, maxN, -1, PQ);
  target.resize(maxN);
  auto it = PQ.begin();
  for (int i = 0; i < maxN; i++, it++) target[i] = (*it) % 1009;
}
int rek(int x, int y, int sum) {
  if (x == y) {
    d[tart].resize(db[x] + 1);
    for (int i = 0; i < db[x] + 1; i++) d[tart][i] = 1;
    tart++;
    return tart - 1;
  }
  int fel = x;
  int num = 0;
  while (num <= sum / 2 && fel != y) {
    num += db[fel];
    fel++;
  }
  int bal = rek(x, fel - 1, num);
  int jobb = rek(fel, y, sum - num);
  mul(d[bal], d[jobb], d[tart]);
  tart++;
  return tart - 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  root = hat(3, 119);
  roots[0] = 1;
  for (int i = 1; i < hat2; i++) {
    long long c = roots[i - 1];
    c = (c * root) % mod;
    roots[i] = c;
  }
  cin >> N >> M >> K;
  K = min(K, N - K);
  for (int i = 0; i < N; i++) {
    cin >> a;
    db[a]++;
  }
  int id = rek(1, M, N);
  if (d[id].size() <= K) {
    cout << 0 << '\n';
  } else {
    cout << d[id][K] << '\n';
  }
  return 0;
}
