#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
const int maxn = 500;
int q[maxn + 5];
int sum[maxn + 5];
int fac[maxn + 5], c[maxn + 5];
int f[maxn + 5][maxn + 5];
int main() {
	int n, K;
	scanf("%d%d", &n, &K);
	for (int i = 1; i <= n; i++) scanf("%d", &q[i]);
	for (int i = 2; i <= n; i++) sum[i] = sum[i - 1] + (q[i] < q[i - 1]);
	fac[0] = 1;
	for (int i = 1; i <= n; i++) {
		fac[i] = mul(fac[i - 1], i);
		c[i] = fac[i];
		for (int j = 1; j < i; j++) c[i] = sub(c[i], mul(c[j], fac[i - j]));
	}
	f[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < i; j++)
			if (sum[j + 1] == sum[i])
				for (int k = 1; k <= j + 1; k++) f[i][k] = add(f[i][k], mul(f[j][k - 1], c[i - j])); 
	}
	int ans = 0;
	if (sum[n]) {
		int fir = 0;
		for (int i = 2; i <= n; i++)
			if (sum[i]) { fir = i - 1; break; }
		if (q[fir + 2] < q[fir]) ans = K <= n - fir ? 0 : f[fir][K - n + fir];
		else {
			for (int j = 0; j < min(n - fir, K); j++)
				if (sum[n - j] == sum[fir + 1]) ans = add(ans, mul(f[fir][K - j - 1], fac[n - fir - j - 1]));
		}
	} else {
		for (int i = K; i <= n; i++) ans = add(ans, f[n][i]);
	}
	printf("%d", ans);
}