#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 505
#define mod 998244353
IL int read()
{
    reg int x=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return x;
}

IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){reg long long r=1ll*x*y; return r<mod?r:r%mod;}

int fac[N],ifac[N],inv[N];

IL void init(reg int n)
{
    fac[0]=ifac[0]=inv[1]=1;
    for(reg int i=2;i<=n;++i)inv[i]=Mul(mod-mod/i,inv[mod%i]);
    for(reg int i=1;i<=n;++i)fac[i]=Mul(fac[i-1],i),ifac[i]=Mul(ifac[i-1],inv[i]);
}

IL int C(reg int n,reg int m){return Mul(fac[n],Mul(ifac[m],ifac[n-m]));}

int n,k,q[N],f[N],g[N][N],ans;

namespace sub1
{
    int main()
    {
        for(reg int i=k;i<=n;++i)Pls(ans,g[n][i]);
        return printf("%d\n",ans),0;
    }
}

main()
{
    n=read(),k=read(),init(n),f[0]=1;
    for(reg int i=1,j;i<=n;++i)
    {
        f[i]=fac[i];
        for(j=1;j<i;++j)Dec(f[i],Mul(f[j],fac[i-j]));
    }
    g[0][0]=1;
    for(reg int i=1,j,k;i<=n;++i)for(j=1;j<=i;++j)
        for(k=j;k<=i;++k)Pls(g[i][j],Mul(g[k-1][j-1],f[i-k+1]));
    for(reg int i=1;i<=n;++i)q[i]=read();
    bool flag=1;
    for(reg int i=1;i<=n;++i)flag&=q[i]==i;
    if(flag)return sub1::main();
    for(reg int i=1,j;i<=n;++i)if(q[i]>q[i+1])
    {
        if(k>n-i)Pls(ans,g[i][k-n+i]);
        if(q[i]<q[i+2])
        {
            for(j=i+2;j<=n&&q[j]>q[j-1];++j)
                if(k>n-j+1)Pls(ans,Mul(g[i][k-n+j-1],fac[j-i-1]));
        }
        printf("%d\n",ans);
        break;
    }
}