#include <bits/stdc++.h>
#define rep(i, f, t) for(int i(f); i <= t; ++i)
#define re(i, t) for(int i(1); i <= t; ++i)
#define per(i, t, f) for(int i(t); i >= f; --i)
#define pe(i, t) for(int i(t); i >= 1; --i) 
#define nx(i, u) for(int i(head[u]); i; i = e[i].nxt) 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
// #define int long long
using namespace std; 
typedef pair <int, int> pii; 
#define pb push_back
#define fi first
#define se second 
#define ix(l, r) ((l + r) | (l != r)) 
#define ls (ix(l, mid))
#define rs (ix(mid + 1, r))
#define mp(i, j) (make_pair(i, j))
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f 
#define eps 1e-10 
#define look_memory cerr<<abs(&sT-&eD)/1024.0/1024<<'\n'
bool sT;


namespace IO {
char buf[1<<21], *p1 = buf, *p2 = buf, buf1[1<<21];
inline char gc () {return p1 == p2 && (p2 = (p1 = buf) + fread (buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++;}

#ifndef ONLINE_JUDGE
#endif

#define gc getchar

template<class I>
inline void read(I &x) {
    x = 0; I f = 1; char c = gc();
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = gc(); }
    while(c >= '0' && c <= '9') {x = x * 10 + c - '0'; c = gc(); }
    x *= f;
}

template<class I>
inline void write(I x) {
    if(x == 0) {putchar('0'); return;}
    I tmp = x > 0 ? x : -x;
    if(x < 0) putchar('-');
    int cnt = 0;
    while(tmp > 0) {
        buf1[cnt++] = tmp % 10 + '0';
        tmp /= 10;
    }
    while(cnt > 0) putchar(buf1[--cnt]);
}

#define in(x) read(x)
#define outn(x) write(x), putchar('\n')
#define out(x) write(x), putchar(' ')

}using namespace IO;

const int N = 505;
const int mod = 998244353;
int n, m, ans;
int a[N], fac[N], inv[N];

inline int ksm (int a, int b) {
    ll ans = 1, base = a;
    while(b) {
        if(b & 1) ans = ans * base % mod;
        base = base * base % mod;
        b >>= 1;
    }
    return ans;
}

inline int C (int n, int m) {
    if(n < 0 || m < 0 || n < m) return 0;
    return 1ll * fac[n] * inv[m] % mod * inv[n-m] % mod;
}


int f[N], dp[N][N], g[N][N], h[N][N];
int val[N], len;

void work () {
    f[1] = 1;
    rep(i, 2, n) {
        f[i] = fac[i];
        re(j, i-1) {
            f[i] = (f[i] + mod - 1ll * f[j] * fac[i-j] % mod) % mod;
        }
    }
    re(i, n-m+1) dp[1][i] = f[i];
    rep(i, 2, m) {
        rep(j, i, n-(m-i)) {
            re(k, j-1) {
                dp[i][j] = (dp[i][j] + 1ll * dp[i-1][k] * f[j-k] % mod) % mod;
            }
        }
    } 
    int t = 0;
    while(a[t] < a[t+1]) ++t;
    if(t == n) {
        int ans = 0;
        re(i, n) {
            ans = (ans + 1ll * dp[m][i] * fac[n-i] % mod) % mod;
        }
        outn(ans);
        exit(0);
    }
    int ans = 0;
    rep(s, t + 1, n) {
        if(s > t + 1 && (a[s] < a[t] || a[s] < a[s-1])) break;
        int c = m + s - n - 1;
        if(c < 1) continue;
        ans = (ans + 1ll * fac[s-t-1] * dp[c][t] % mod) % mod;
    }
    outn(ans);
}

int main () {
    read(n),read(m);
    fac[0] = inv[0] = 1;
    re(i, n) {
        fac[i] = 1ll * fac[i-1] * i % mod;
        inv[i] = ksm(fac[i], mod-2);
    }
    re(i, n) read(a[i]);
    work();
    return 0;
}