#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
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) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 1e3+1, oo = 1e9;
const long long MD = 998244353;
template<long long MOD=MD> struct mdint {
    int d=0;
    mdint () {d=0;}
    mdint (long long _d) : d(_d%MOD){
        if(d<0) d+=MOD;
    };
    friend mdint& operator+=(mdint& a, const mdint& o) {
        a.d+=o.d; if(a.d>=MOD) a.d-=MOD;
        return a;
    }
    friend mdint& operator-=(mdint& a, const mdint& o) {
        a.d-=o.d; if(a.d<0) a.d+=MOD;
        return a;
    }
    friend mdint& operator*=(mdint& a, const mdint& o) {
        return a = mdint((ll)a.d*o.d);
    }
    mdint operator*(const mdint& o) const {
        mdint res = *this;
        res*=o;
        return res;
    }
    mdint operator+(const mdint& o) const {
        mdint res = *this;
        res+=o;
        return res;
    }
    mdint operator-(const mdint& o) const {
        mdint res = *this;
        res-=o;
        return res;
    }
    mdint operator^(long long b) const {
        mdint tmp = 1;
        mdint power = *this;
        while(b) {
            if(b&1) {
                tmp = tmp*power;
            }
            power = power*power;
            b/=2;
        }
        return tmp;
    }
    friend mdint operator/=(mdint& a, const mdint& o) {
        a *= (o^(MOD-2));
        return a;
    }
    mdint operator/(const mdint& o) {
        mdint res = *this;
        res/=o;
        return res;
    }
    bool operator==(const mdint& o) { return d==o.d;}
    bool operator!=(const mdint& o) { return d!=o.d;}
    friend istream& operator>>(istream& c, mdint& a) {return c >> a.d;}
    friend ostream& operator<<(ostream& c, const mdint& a) {return c << a.d;}
};
using  mint = mdint<MD>;
const int mxF = 2e3+2;
mint fact[mxF], ifact[mxF];
mint ncr(int a, int b) {
    if(b>a or a<0 or b<0) return 0;
    return fact[a]*ifact[b]*ifact[a-b];
}
void precomp() {
    fact[0]=1;
    for(int i=1;i<mxF;++i) {
        fact[i]=fact[i-1]*i;
    }
    ifact[mxF-1] = mint(1)/fact[mxF-1];
    for(int i=mxF-2;i>=0;--i) {
        ifact[i]=ifact[i+1]*(i+1);
    }
}
mint dp[mxN][mxN],nopartition[mxN];
int main() {
    precomp();
    int n,k; cin >> n >> k;
    vi q(n);
    for(int i=0;i<n;++i) {
        cin >> q[i];
    }
    vvi who(n);
    int mx=0;
    for(int i=1;i<=n;++i) {
        mx = max(mx,q[i-1]);
        for(int j=1;j<=mx;++j) if(!count(q.begin(),q.begin()+i,j)) {
            who[i].push_back(j);
        }

    }
    for(int i=1;i<=n;++i) {
        nopartition[i] = fact[i];
        for(int j=1;j<i;++j) {
            nopartition[i]-=nopartition[j]*fact[i-j];
        }
    }
    dp[k][0]=1;
    bool inside[mxN] = {};
    for(int i=k;i>0;--i) {
        for(int j=0;j<n;++j) if(dp[i][j].d) {
            int nbad = who[j].size();
            if(nbad>i) continue;
            
            // cerr << i << ' ' << j << ": " << dp[i][j] << '\n';
            for(auto x : who[j]) inside[x]=1;
            int use=0;
            for(int to = j+1;to<=n;++to) {
                if(to>j+1 and q[to-1]<q[to-2]) break;
                use += inside[q[to-1]];
                if(to-1>=n-i and use==1) {
                    dp[i-1][to]+=dp[i][j]*fact[to-j-1]; // must be the last one.
                } else if(use==0 and nbad<i and to<=n-nbad) {
                    // who[j] is full.
                    // needs to get rid of one.
                    // this one is in there.
                    if(i==1 and to==n) {
                        dp[i-1][to]+=dp[i][j]*fact[to-j];
                    } else dp[i-1][to]+=nopartition[to-j]*dp[i][j];
                }

            }
            for(auto x : who[j]) inside[x]=0;

        }
    }
    cout << dp[0][n] << '\n';
}