#include <bits/stdc++.h>

#define lsb(x) (x & (-x))

using ull = unsigned long long;
using ll = long long;

using namespace std;

const int NMAX = 1e6 + 1;
const int MOD = 998244353;

int n;
int aib[NMAX];
int fact[NMAX];

void u(int x) {
  for (int i = x; i <= n; i += (i & (-i)))
    aib[i] += 1;
}

int q(int x) {
  int a = 0;
  for (int i = x; i >= 1; i -= (i & (-i)))
    a += aib[i];

  return a;
}

int lgput(int x, int p) {
  int ans = 1, aux = x;
  for (int i = 1; i <= p; i <<= 1) {
    if (i & p)
      ans = 1LL * ans * aux % MOD;
    aux = 1LL * aux * aux % MOD;
  }
  
  return ans;
}

int invmod(int x) {
  return lgput(x, MOD - 2);
}

int c(int n, int k) {
  return 1LL * fact[n] * invmod(fact[k]) % MOD * invmod(fact[n - k]) % MOD; 
}

void solve() {
  int k;
  cin >> n >> k;
  
  fact[0] = 1;
  for (int i = 1; i <= n; ++i)
    fact[i] = fact[i - 1] * 1LL * i % MOD;
  stack<int> st;
  int nr = 0;
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;

    if (!st.empty() && st.top() >= x) {
      while (!st.empty())
        st.pop();
    }
    st.push(x);

    if (st.size() >= k) {
      nr = nr + c(st.size() - 1, k - 1);
      if (nr >= MOD)
        nr -= MOD;
    }
  }

  if (k % 2 && nr > 0)
    nr = -nr + MOD;
  cout << nr << endl;
}

int main() {
#ifdef HOME
  ifstream cin("input.in");
  ofstream cout("output.out");
#endif
  ios::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  
  int t = 1;
  //cin >> t;
  while (t--)
    solve();

  return 0;
}