#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define double long double
#define x first
#define y second
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using pii=pair <int,int>;
using tii=pair <pii,int>;
using rii=pair <int,pii>;
using qii=pair <pii,pii>;
const int mod=998244353LL;
int f[2000010],inv[2000010],finv[2000010];
void init(){
    f[0]=f[1]=inv[0]=inv[1]=finv[0]=finv[1]=1;
    for (int i=2; i<2000010; i++){
        f[i]=f[i-1]*i%mod;
        inv[i]=inv[mod%i]*(mod-mod/i)%mod;
        finv[i]=finv[i-1]*inv[i]%mod;
    }
}
int ncr(int n,int r){
    if (n<r) return 0;
    return f[n]*finv[n-r]%mod*finv[r]%mod;
}
void solve(){
    int n,k;
    cin>>n>>k;
    int p[n+1];
    for (int i=1; i<=n; i++) cin>>p[i];
    vector <int> v;
    v.pb(1);
    for (int i=2; i<=n; i++){
        if (p[i-1]>p[i]) v.pb(1);
        else v.back()++;
    }
    int ans=0;
    for (int i:v){
        ans+=ncr(i,k);
        ans%=mod;
    }
    if (k&1) ans=(mod-ans)%mod;
    cout<<ans<<'\n';
}
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t=1;
    //cin>>t;
    init();
    while (t--) solve();
}