#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 5005, P = 998244353;

inline void inc(int &x, int y) { x += y - P; x += (x >> 31) & P; }
inline void dec(int &x, int y) { x -= y;     x += (x >> 31) & P; }

int n, m, ans, fc[N], g[N], f[N][N];
int a[N];

signed main() {
	n = read(); m = read(); 
	rep(i, 1, n) a[i] = read();
	
	// calculate g
	g[0] = fc[0] = 1;
	rep(i, 1, n) {
		g[i] = fc[i] = 1ll * i * fc[i - 1] % P;
		rep(j, 1, i - 1) dec(g[i], 1ll * fc[j] * g[i - j] % P);
	}
	
	// calculate f
	f[0][0] = 1;
	rep(i, 1, n) rep(k, 0, n) if(f[i - 1][k - 1]) {
		int lmt = n - (m - k);
		for(int j = i, fl = 1; j <= lmt && fl; j++, fl &= a[j] > a[j - 1]) {
			if(a[i] > a[i - 1]) inc(f[j][k], 1ll * g[j - i + 1] * f[i - 1][k - 1] % P);
			else if(j == lmt && (j == i || a[i + 1] > a[i - 1])) 
				inc(f[j][k], 1ll * fc[j - i] * f[i - 1][k - 1] % P);
		}
	}
	
	rep(i, m, n) inc(ans, f[n][i]);
	cout << ans << endl;
	return 0;
}