#include<bits/stdc++.h>
#define int long long
#define repe(i,l,r) for(int (i)=l;(i)<=r;(i)++)
#define rep(i,n) for(int (i)=1;(i)<=n;(i)++)
#define FOR(i,r,l) for(int (i)=r;(i)>=l;(i)--)
#define INF 0x3f3f3f
#define pii pair<int,int>
#define mpr make_pair
#define pb push_back
#define ALL(v) (v).begin(),(v).end()
#define rsort(v) sort(ALL(v),greater<int>())
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
using namespace std;
int read(){int sum=0,f=1;char c;c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){sum=(sum<<1)+(sum<<3)+(c-'0');c=getchar();}return sum*f;}
void out(int x){if(x<0){x=-x;putchar('-');}if(x>=10)out(x/10);putchar(x%10+'0');}
template <typename T>void die(T s){cout<<s<<endl;exit(0);}
int fast(int a,int b,int P){int res=1;if(P<=0){while(b){if(b&1)res=res*a;a=a*a;b>>=1;}}else{while(b){if(b&1)res=res*a%P;a=a*a%P;b>>=1;}}return res;}
template <typename T>void chkmax(T& a,T b){if(a<b)a=b;return;}
template <typename T>void chkmin(T& a,T b){if(a>b)a=b;return;}
int n,k;
const int N=1e7+4,P=998244353;
int a[N];
int fac[N],inv[N];
int mn;
void init(){
    fac[0]=1;
    for(int i=1;i<N;i++)fac[i]=fac[i-1]*i%P;
    inv[N-1]=fast(fac[N-1],P-2,P);
    FOR(i,N-2,1){
        inv[i]=inv[i+1]*(i+1)%P;
    }
    return;
}
int C(int n,int m){
    return fac[n]*inv[n-m]%P*inv[m]%P;
}
signed main(){
    n=read(),k=read();
    for(int i=1;i<=n;i++){
        a[i]=read();
    }
    mn=n+1;
    int tot=0;
    for(int i=n;i>=1;i--){
        chkmin(mn,a[i]);
        if(mn==a[i])tot++;
    }
    init();
    // cout<<tot<<endl;
    int ans=0;
    if(k<=tot){
        ans=fac[tot]*inv[k]%P*inv[tot-k]%P;
    }
    printf("%lld\n",((k&1)? P-ans:ans)%P);
    return 0;
}