#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 998244353;
const int MAXN = 1e6 + 5;
const ll INF = 2e18;

int fat[MAXN], inv[MAXN];

ll fexp(ll b, ll e) {
    ll ans = 1;
    while (e) {
        if (e&1) ans = (ans * b) % MOD;
        b = (b * b) % MOD;
        e >>= 1;
    }
    return ans;
}

void precalc() {
    fat[0] = 1;
    for (int i = 1; i < MAXN; i++) fat[i] = (1ll * i * fat[i - 1]) % MOD;
    inv[MAXN - 1] = fexp(fat[MAXN - 1], MOD - 2);
    for (int i = MAXN - 2; i >= 0; i--) inv[i] = ((i + 1ll) * inv[i + 1]) % MOD;
}

int nck(int n, int k) {
    if (k > n || k < 0 || n < 0) return 0;
    return (((1ll * fat[n] * inv[k]) % MOD) * 1ll * inv[n - k]) % MOD; 
}

void add(int &a, int b) {
    a += b;
    if (a >= MOD) a -= MOD;
    if (a < 0) a += MOD;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

int v[MAXN], esq[MAXN], qtd[MAXN], dir[MAXN];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    precalc();

    int n, k;
    cin >> n >> k;

    
	for (int i = 1; i <= n; i++) {
		cin >> v[i];
        esq[i] = i - 1;
        dir[i] = i + 1;
	}
	for (int i = 1; i <= n; i++) {
		while (v[esq[i]] >= v[i]) {
			esq[i] = esq[esq[i]];
		}
	}
    for (int i = n; i >= 1; i--) {
        while (v[dir[i]] >= v[i]) {
            dir[i] = dir[dir[i]];
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        qtd[i] = qtd[esq[i]] + 1;
        if (dir[i] == n + 1) {
            add(ans, nck(qtd[i] - 1, k - 1));
        }
    }
    if (k & 1) {
        cout << (998244353 - ans) % MOD << '\n';
    }
    else {
        cout << ans << '\n';
    }
    return 0;
}