#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define all(v) v.begin(), v.end()
#define pb push_back

void dbg_out() { cerr << endl; }
template<typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

template<int MOD> 
struct mint {
	int x;

	mint(): x(0) {}
	mint(int y): x(y<0?y%MOD+MOD : y%MOD) {}
	
	void operator+=(mint rhs) { x += rhs.x; if(x>=MOD) x-= MOD; }
	void operator-=(mint rhs) { x -= rhs.x; if(x<0) x+= MOD; }
	void operator*=(mint rhs) { x *= rhs.x; x %= MOD; }
	void operator/=(mint rhs) { *this *= rhs.inv(); }
	mint operator+(mint rhs) { mint res = *this; res += rhs; return res; }
	mint operator-(mint rhs) { mint res = *this; res -= rhs; return res; }
	mint operator*(mint rhs) { mint res = *this; res *= rhs; return res; }
	mint operator/(mint rhs) { mint res = *this; res /= rhs; return res; }

	mint inv() { assert(x != 0); return this->pow(MOD-2); }
	mint pow(int e) {
		mint res = 1;
		for(mint p=*this;e>0;e/=2,p*=p) if(e%2)
			res *= p;
		return res;
	}
};
using Z = mint<998244353>;

void solve() {
	int n, k; cin >> n >> k;
	vector<int> a (n);
	for (auto &u : a) cin >> u;

	vector<Z> fat (n + 1);
	fat[0] = 1;
	for (int i = 1; i <= n; i++) fat[i] = fat[i - 1] * i;
	auto comb = [&] (int x, int y) {
		if (y > x) return Z(0);
		return fat[x] / fat[y] / fat[x - y];
	};

	Z ans = 0;
	int cur = 1;
	for (int i = 1; i < n; i++) {
		if (a[i] < a[i - 1]) {
			ans += comb (cur, k);
			cur = 1;
		}
		else cur++;
	}
	ans += comb (cur, k);

	cout << (ans * (k & 1 ? -1 : 1)).x << "\n";
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	solve();
}