#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 998244353;
const ll INF = 1e16;
  
int main() {
    ll n, K;
    cin >> n >> K;

    vl a(n+1);
    exrep(i, 1, n) {
        cin >> a[i];
    }
    sort(all(a));

    vvl dp(n+1, vl(K+1));  // dp[i][j] : i個挿入して、転倒数がjとなる場合の数
    dp[1][0] = 1;
    ll x =  0;  // いままで現れた、いまから挿入する数の個数
    exrep(i, 1, n-1) {
        exrep(j, 0, K) {
            if(a[i] < a[i+1]) {
                x = 0;
            }
            else if(a[i] == a[i+1]) {
                x++;
            }
            exrep(k, 0, i - x) {
                if(j + k <= K) {
                    dp[i+1][j + k] += dp[i][j];
                    dp[i+1][j + k] %= mod;
                }
            }
        }
    }

    out(dp[n][K]);
    re0;
}