// author : HuuHung
// 25.3.2024


#include <bits/stdc++.h>
#define ii pair <int, int>
#define F first
#define S second
#define ll long long
#define lb long double
#define pb push_back
#define vi vector <int>
#define vll vector <ll>
#define Bit(x, i) ((x) >> (i) & 1)
#define Mask(i) (1ll << (i))
#define All(v) (v).begin(), (v).end()

using namespace std;

void maxzi(auto &a, auto b){
    a = max(a, b);
}

void minzi(auto &a, auto b){
    a = min(a, b);
}

const int N = 2e5 + 5;
const int mod = 998244353;
const int LG = 20;

void add(auto &a, auto b){
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int Pow(int a, int b){
    if (b == 0) return 1;
    if (b % 2) return 1ll * a * Pow(a, b - 1) % mod;
    int c = Pow(a, b / 2);
    return 1ll * c * c % mod;
}

// * end

void solve(){
    int n, z;
    cin >> n >> z;
    vi p(n + 3, 0);
    int la = 1e9;
    for (int i = 0; i < n; ++ i) cin >> p[i + 1];
    for (int i = 0; i < n; ++ i) if (i == n - 1 || p[i] > p[i + 1]){minzi(la, i + 1);};
    vi gt(n + 3);
    gt[0] = 1;
    for (int i = 1; i <= n; ++ i) gt[i] = 1ll * gt[i - 1] * i % mod;
    vector <vi> dp(n + 3);
    vi dm(n + 3);
    dm[1] = 1;
    for (int i = 2; i <= n; ++ i){
        dm[i] = gt[i];
        for (int j = 1; j < i; ++ j) add(dm[i], -(1ll * dm[i - j] * gt[j] % mod));
    }
    for (int i = 0; i <= n; ++ i) dp[i].resize(n + 2, 0);
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++ i){
        for (int k = 1; k <= n; ++ k) if (dp[i - 1][k - 1]){
            int lm = n - (z - k);
            for (int j = i, fl = 1; j <= lm && fl; j ++, fl &= p[j] > p[j - 1]){
                if (p[i] > p[i - 1]) add(dp[j][k], 1ll * dp[i - 1][k - 1] * dm[j - i + 1] % mod);
                else if (j == lm && (j == i || p[i + 1] > p[i - 1])){
                    add(dp[j][k], 1ll * dp[i - 1][k - 1] * gt[j - i] % mod);
                }
            }
        }
    }
    int ans = 0;
    for (int i = z; i <= n; ++ i) add(ans, dp[n][i]);
    cout << ans;
}


int main(){
    //freopen("code.inp", "r", stdin);
    //freopen("code.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t --) solve();

    return 0;
}