#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 998244353
ll n,k,q[550],jc[550],f[550],g[550][550],ans=0;
bl ck[550][550];
int main(){
	n=read();
	k=read();
	fr(i,1,n) q[i]=read();
	jc[0]=1;
	fr(i,1,n) jc[i]=jc[i-1]*i%mod;
	f[1]=1;
	fr(i,2,n){
		f[i]=jc[i];
		fr(j,1,i-1) f[i]=(f[i]-f[j]*jc[i-j]%mod+mod)%mod;
	}
	fr(i,1,n){
		g[i][1]=f[i];
		fr(j,2,i) fr(l,j-1,i-1) g[i][j]=(g[i][j]+g[l][j-1]*f[i-l]%mod)%mod;
	}
	fr(i,1,n){
		ck[i][i]=1;
		fr(j,i+1,n){
			if(q[j]<q[j-1]) break;
			ck[i][j]=1;
		}
	}
	if(k==1){
		if(!ck[1][n]) write(0);
		else write(jc[n]);
		return 0;
	}
	fr(l,1,n-1){
		fr(r,l,n-1){
			if(!ck[l][r]) break;
			if(l==1){
				if(r!=(n-k+1)) continue;
				ans=(ans+f[n-k+1])%mod;
			}
			else if(q[l]>q[l-1]){
				if(!ck[1][l-1]) continue;
				ll tmp=n-r;
				if((tmp+2)>k) continue;
				if(l==r) continue;
				ans=(ans+g[l-1][k-tmp-1]*f[r-l+1]%mod)%mod;
			}
			else if(l==r||q[l+1]>q[l-1]){
				if(!ck[1][l-1]) continue;
				ll tmp=n-r;
				if((tmp+2)>k) continue;
				if(l==r) continue;
				ans=(ans+g[l-1][k-tmp-1]*jc[r-l]%mod)%mod;
			}
		}
	}
	fr(l,k,n-1){
		if(!ck[1][l-1]||!ck[l][n]) continue;
		if(q[l]>q[l-1]) ans=(ans+g[l-1][k-1]*jc[n-l+1]%mod)%mod;
		else if(q[l+1]>q[l-1]) ans=(ans+g[l-1][k-1]*jc[n-l]%mod)%mod;
	}
	write(ans);
}