#include<iostream>
#include<cstdio>
#define N 500
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int n,k,fac[N+1],q[N+1],F[N+1],maxn[N+1],dp[N+1][N+1];
int main()
{
	fac[0]=1;
	for (int i=1;i<=N;++i) fac[i]=1ll*fac[i-1]*i%mod;
	n=read(),k=read();
	for (int i=1;i<=n;++i) q[i]=read(),maxn[i]=max(maxn[i-1],q[i]);
	for (int i=0;i<=n;++i)
	{
		F[i]=fac[i];
		for (int j=1;j<=i-1;++j) Adder2(F[i],-1ll*F[j]*fac[i-j]%mod);
	}
	dp[0][0]=1;
	for (int i=1;i<=k;++i)
		for (int j=1;j<=n-(k-i);++j)
			for (int t=j;t>=1;--t)
			{
				if (j!=t&&q[t]>q[t+1]) break;
				if (j==n-(k-i))
				{
					if (q[t]>maxn[t-1]) Adder(dp[i][j],1ll*dp[i-1][t-1]*((i!=k)?F[j-t+1]:fac[j-t+1])%mod);
					else
					{
						if (j!=t&&q[t+1]<maxn[t-1]) continue;
						Adder(dp[i][j],1ll*dp[i-1][t-1]*fac[j-t]%mod);
					}
				}
				else
				{
					if (q[t]<maxn[t-1]) continue;
					Adder(dp[i][j],1ll*dp[i-1][t-1]*((i!=k)?F[j-t+1]:fac[j-t+1])%mod);
				}
			}
	printf("%d\n",dp[k][n]);
	return 0;
}