#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array

#define N 101
#define mod 998244353
#define inf 1e9

using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

int qp(int x,int y=mod-2){int ans=1;while(y){if(y&1)ans=ans*1ll*x%mod;x=x*1ll*x%mod;y>>=1;}return ans;}

struct frac{
    double val;
    int res;
    frac(double val=0,int res=0):val(val),res(res){}
    frac operator +(const frac &x)const{
        return frac(val+x.val,(res+x.res)%mod);
    }
    frac operator +(const int &x)const{
        return frac(val+x,(res+x)%mod);
    }
    frac operator *(const frac &x)const{
        return frac(val*x.val,(res*1ll*x.res)%mod);
    }
}f[N][N];

int a[N];

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif

    int n=read(),m=read(),cnt=0,sum=0,sum2=0;
    for(int i=1;i<=n;i++)a[i]=read(),cnt+=(a[i]>m),sum+=(a[i]>m?a[i]:0),sum2+=(a[i]<=m?a[i]:0);
    if(cnt==n){write(n*m);return 0;}
    if(cnt==0){write(sum2);return 0;}

    frac E=frac(sum*1.0/cnt,sum*1ll*qp(cnt)%mod),E2=frac(sum2*1.0/(n-cnt),sum2*1ll*qp(n-cnt)%mod);
    for(int j=0;j<=n;j++)f[n+1][j]=frac(inf,0);
    f[n+1][cnt]=frac(0,0);
    for(int i=n;i>=1;i--){
        for(int j=min(i,cnt);j>=max(0,cnt-(n-i+1));j--){
            int A=n-i+1,B=cnt-j;
            frac p=frac(B*1.0/A,B*1ll*qp(A)%mod);
            frac q=frac((A-B)*1.0/A,(A-B)*1ll*qp(A)%mod);
            f[i][j]=frac(m,m)+p*f[i+1][j+1]+q*f[i+1][j];
            frac tmp;
            tmp=E*p+p*f[i+1][j+1]+q*E2+q*f[i+1][j];
            if(tmp.val<f[i][j].val)f[i][j]=tmp;
        }
    }
    write(f[1][0].res);
    return 0;
}