#include <bits/stdc++.h>


using namespace std;

template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef ONPC
  #define deb(...) cerr << '[' << __FILE__ << ':' << __LINE__ << "] (" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
  #pragma GCC optimize("O3,unroll-loops")
  #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
  #define deb(...)
#endif

// c++ short types
#define vt vector
//typedef long long ll;
typedef long double ld;

void whattime() { cout << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl; }
// const int mod = 1e9 + 7;
const int mod = 998244353;
const int inf = 1e9;
const int64_t infll = 1e13;
bool debug = false;
const ld eps = 1e-9;
const ld pi = acos(-1);
mt19937_64 rng((int) chrono::steady_clock::now().time_since_epoch().count());

int mul(int a, int b) {
  return a * 1ll * b % mod;
}
int bin_pow(int b, int p) {
  int r = 1;
  for(;p;p>>=1,b=mul(b,b)) {
    if(p&1) {
      r = mul(r, b);
    }
  }
  return r;
}
int inv(int x) {
  return bin_pow(x, mod - 2);
}

void solve() {
  int n, k; cin >> n >> k;
  vt<int> fact(n + 1, 1), ifact(n + 1, 1);
  for(int i = 1; i <= n; ++i) {
    fact[i] = mul(fact[i-1], i);
  }
  ifact.back() = inv(fact.back());
  for(int i = n-1; i >= 1; --i) {
    ifact[i] = mul(ifact[i+1], i + 1);
  }
  auto choose = [&](int n, int k) {
    if(n < k) {
      return 0;
    }
    return mul(fact[n], mul(ifact[k], ifact[n-k]));
  };
  vt<int> a(n);
  for(int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  vt<int> st;
  for(int i = 0; i < n; ++i) {
    while(not st.empty() and a[st.back()] > a[i]) {
      st.pop_back();
    }
    st.push_back(i);
  }
  int res = choose(st.size(), k);
  if(k & 1) {
    res = (mod - res)%mod;
  }
  cout << res << '\n';
}

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

	int tt = 1;;
	if(debug) {
		tt = 1e3;
	} else {
	}

	for(int t = 0; t < tt; ++t) {
		solve();
	}
	
#ifdef ONPC
	whattime();
#endif
	
	return 0;
}