//code by Nobody.Emissary
#include<bits/stdc++.h>

using namespace std;

const int MAXN = 505;
const int mod = 998244353;

int n, k, q[MAXN], p[MAXN];
int f[MAXN][MAXN], g[MAXN], fac[MAXN];

inline void prework(int lim){
	fac[0]=1;
	for(int i=1;i<=lim;++i) fac[i]=1ll*fac[i-1]*i%mod;
	g[1]=1;
	for(int i=2;i<=n;++i){
		g[i]=fac[i];
		for(int j=1;j<i;++j) (g[i]+=mod-1ll*g[j]*fac[i-j]%mod)%=mod;
	}
	return ;
}

inline bool check(int l, int r){
	for(int i=l+1;i<=r;++i) if(p[i]<p[i-1]) return 0;
	return 1;
}

inline void solve(){
	f[1][1]=1;
	for(int i=2;i<=n;++i){
		if(q[i]<q[i-1]) break;
		f[i][1]=g[i];
	}
	for(int i=1;i<=n;++i){
		int v=q[i]; p[i]=v; q[i]=0;
		for(int j=1;j<=min(i,k-1);++j){
			int limpos=n-(k-j)+1, now=0;
			for(int o=i+1;o<=limpos;++o){
				now+=q[o]<v;
				if(now>1 || q[o]<q[o-1]) break;
				if(now && o<limpos) continue;
				if(now) (f[o][j+1]+=1ll*f[i][j]*fac[o-i-1]%mod)%=mod;
				else (f[o][j+1]+=1ll*f[i][j]*g[o-i]%mod)%=mod;
			}
		}
	}
	f[0][0]=1; int ans=0;
	for(int i=0;i<n;++i)
		if(check(i+1,n)){
			if(i+2<=n && p[i+1]<p[i] && p[i+2]<p[i]) continue;
			if(p[i+1]>p[i]) (ans+=1ll*f[i][k-1]*fac[n-i]%mod)%=mod;
			else (ans+=1ll*f[i][k-1]*fac[n-i-1]%mod)%=mod;	
		}
	cout << ans << endl;
	return ;
}

int main(){
	cin >> n >> k;
	for(int i=1;i<=n;++i) cin >> q[i];
	prework(n); solve();
	return 0;
}
/*
6 3
1 2 5 3 4 6
*/