#include <bits/stdc++.h>
using namespace std;
const int N = 505;
const int mod = 998244353;

inline int add(int x, int y) {x += y; return x >= mod ? x - mod : x;}
inline int del(int x, int y) {x -= y; return x < 0 ? x + mod : x;}
inline void Add(int &x, int y) {x = add(x, y);}
inline void Del(int &x, int y) {x = del(x, y);}

int n, k, a[N], ans, f[N], dp[N][N], mx[N], sum[N][N], fac[N];

int main() {
	scanf("%d%d", &n, &k);
	fac[0] = 1;
	for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
	for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
	for (int i = 1; i <= n; ++i) {
		f[i] = fac[i];
		for (int j = 1; j < i; ++j) Del(f[i], 1ll * f[j] * fac[i - j] % mod);
	}
	for (int i = 1; i <= n; ++i) mx[i] = max(mx[i - 1], a[i]);
	dp[0][0] = 1;
	for (int o = 1; o < k; ++o) {
		for (int i = o; i + k - o <= n; ++i) {
			for (int j = i - 1; j >= o - 1; --j) {
				int tmp = (a[j + 1] <= mx[j]) + (j + 2 <= i && a[j + 2] <= mx[j]);
				if (tmp == 0) Add(dp[o][i], 1ll * dp[o - 1][j] * f[i - j] % mod);
				else if (tmp == 1 && i == n - k + o) Add(dp[o][i], 1ll * dp[o - 1][j] * fac[i - j - 1] % mod);
				else break;
				if (a[j] > a[j + 1]) break;
			}
		}
	}
	for (int i = n; i >= k; --i) {
		int tmp = mx[i - 1] - (i - 1);
		if (tmp == 0) Add(ans, 1ll * dp[k - 1][i - 1] * fac[n - i + 1] % mod);
		else if (tmp == 1) Add(ans, 1ll * dp[k - 1][i - 1] * fac[n - i] % mod);
		else break;
		if (a[i - 1] > a[i]) break;
	}
	printf("%d\n", ans);
	return 0;
}