#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
using LL=long long;
const int P=998244353;
mt19937_64 rng(0);
int ad(int x,int y){return x+y<P?x+y:x+y-P;}
int su(int x,int y){return x-y<0?x-y+P:x-y;}
int mu(int x,int y){return 1ULL*x*y%P;}
int po(int a,int b){
	int ret=1;
	while(b){
		if(b&1)ret=mu(ret,a);
		b>>=1;
		a=mu(a,a);
	}
	return ret;
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	int n, k;
	scanf("%d%d", &n, &k);
	vector <int> a(n);
	for (int i = 0; i < n; i++) scanf("%d", &a[i]);
	int mn = 1e9, cnt = 0;
	for (int i = n - 1; i >= 0; i--) {
		if (a[i] < mn) ++cnt, mn = a[i];
	}
	int ans = 0;
	auto fac = [&](int n) {
		int ret = 1;
		for (int i = 1; i <= n; i++) ret = mu(ret, i);
		return ret;
	};
	if (cnt >= k) {
		ans = fac(cnt);
		ans = mu(ans, po(fac(k), P - 2));
		ans = mu(ans, po(fac(cnt - k), P - 2));
	}
	if (k & 1) ans = su(0, ans);
	printf("%d\n", ans);
	return 0;
}