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

const int MXN = 505;
const int DVS = 998244353;
int N, K, arr[MXN], cnt[MXN][MXN], Pt, ans;
bool type;
int main() {
  cin >> N >> K;
  for (int i(0); i != N; ++i) cin >> arr[i], --arr[i];
  for (int i(1); i != N; ++i) {
    if (arr[i] < arr[i - 1]) {
      Pt = i + 1;
      while (Pt != N && arr[Pt] > max(arr[Pt - 2], arr[Pt - 1])) ++Pt;
      type = 1;
      K -= N - Pt + 1;
      N = i;
      break;
    }
  }
  if (K <= 0) {
    cout << 0 << endl;
    return 0;
  }
//  cout << type << ' ' << N << ' ' << K << endl;
  cnt[1][1] = 1;
  for (int i(2); i <= N; ++i) {
    for (int j(i - 1), f(1); j >= 1; f = f * 1LL * (i - j--) % DVS) {
      cnt[i][1] = (cnt[i][1] + cnt[j][1] * 1LL * f % DVS * j) % DVS;
    }
    for (int j(2); j <= i; ++j) {
      for (int k(1); j - 1 <= i - k; ++k) {
        cnt[i][j] = (cnt[i][j] + cnt[i - k][j - 1] * 1LL * cnt[k][1]) % DVS;
      }
    }
  }
  if (type) {
    for (int i(0); i != Pt - N; ++i) {
      int t(cnt[N][K - i]);
      for (int j(1); j <= Pt - 1 - N - i; ++j) t = t * 1LL * j % DVS;
      ans = (ans + t) % DVS;
    }
  } else {
    for (int i(K); i <= N; ++i) ans = (ans + cnt[N][i]) % DVS;
  }
  cout << ans << endl;
  return 0;
}