#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 1010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


int N, K;
vector<int> P;


namespace brute {
constexpr int MAX_N = 10;
Mint run() {
cerr<<"[brute::run]"<<endl;
  Mint ans = 0;
  vector<int> perm(N);
  for (int i = 0; i < N; ++i) perm[i] = i;
  do {
    vector<int> mn = {N};
    int xs[MAX_N + 1];
    for (int h = 0; h < 1 << (N - 1); ++h) if (__builtin_popcount(h) == K - 1) {
      int xsLen = 0;
      xs[xsLen++] = 0;
      for (int i = 1; i < N; ++i) if (h >> (i - 1) & 1) xs[xsLen++] = i;
      xs[xsLen] = N;
      auto ps = perm;
      for (int j = 0; j < xsLen; ++j) {
        sort(ps.begin() + xs[j], ps.begin() + xs[j + 1]);
      }
      chmin(mn, ps);
    }
    if (mn == P) {
cerr<<perm<<endl;
      ans += 1;
    }
  } while (next_permutation(perm.begin(), perm.end()));
  return ans;
}
}  // brute


/*
              I
  |ooo;oo;oooo|(>a)...(>a)(<a)|o|o|o|
          mx=a
*/
namespace fast {
// cs^k
Mint dss[510][510];
Mint run() {
cerr<<"[fast::run]"<<endl;
  // connected
  vector<Mint> cs(N + 1, 0);
  for (int i = 1; i <= N; ++i) {
    cs[i] = fac[i];
    for (int j = 1; j < i; ++j) {
      cs[i] -= cs[j] * fac[i - j];
    }
  }
// cerr<<"cs = "<<cs<<endl;
  memset(dss, 0, sizeof(dss));
  dss[0][0] = 1;
  for (int k = 1; k <= N; ++k) {
    for (int i = 0; i <= N; ++i) for (int j = 0; i + j <= N; ++j) {
      dss[k][i + j] += dss[k - 1][i] * cs[j];
    }
  }
  
  int I = N;
  for (int i = 1; i < N; ++i) if (P[i - 1] > P[i]) {
    I = i;
    break;
  }
  Mint ans = 0;
  if (I == N) {
    for (int k = K; k <= N; ++k) {
      ans += dss[k][N];
    }
  } else {
    for (int k = 1; k < K; ++k) {
      const int single = K - k - 1;
// cerr<<"I = "<<I<<", k = "<<k<<", single = "<<single<<endl;
      if (I < N - single) {
        bool ok = true;
        for (int i = I + 1; i < N - single; ++i) {
          ok = ok && (P[I - 1] < P[i]);
          ok = ok && (P[i - 1] < P[i]);
        }
        if (ok) {
// cerr<<"  "<<dss[k][I]<<" "<<fac[(N - single) - I - 1]<<endl;
          ans += dss[k][I] * fac[(N - single) - I - 1];
        }
      }
    }
  }
  return ans;
}
}  // fast


int main() {
  prepare();
  
  for (; ~scanf("%d%d", &N, &K); ) {
    P.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &P[i]);
      --P[i];
    }
    
    const Mint ans = fast::run();
    printf("%u\n", ans.x);
#ifdef LOCAL
if(N<=10){
 const Mint brt=brute::run();
 if(brt!=ans)cerr<<N<<" "<<K<<" "<<P<<": "<<brt<<" "<<ans<<endl;
 assert(brt==ans);
}
#endif
  }
  return 0;
}