#include <bits/stdc++.h>

#include <atcoder/modint>

int main() {
  using namespace std;
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (auto&& e : a) cin >> e;
  sort(begin(a), end(a), greater{});
  using Fp = atcoder::modint998244353;
  vector c(n, vector(n + 1, vector<Fp>(n * n + 1)));
  c[0][0][0] = 1;
  for (int i = 0; i < n; ++i) {
    if (i) c[i] = c[i - 1];
    for (int j = 0; j < n; ++j)
      for (int k = 0; k + i <= n * n; ++k) c[i][j + 1][k + i] += c[i][j][k];
  }
  vector<Fp> f{1};
  for (int l = 0; l < int(size(a));) {
    int r = l;
    while (r < n && a[r] == a[l]) ++r;
    vector<Fp> nf;
    for (int i = 0; i < int(size(f)); ++i)
      for (int j = 0; j <= n * n; ++j) {
        if (c[l][r - l][j] == 0) continue;
        if (i + j >= int(size(nf))) nf.resize(i + j + 1);
        nf[i + j] += f[i] * c[l][r - l][j];
      }
    f = move(nf);
    l = r;
  }
  cout << (k < int(size(f)) ? f[k].val() : 0) << '\n';
}