#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int) a.size()
#define all(a) a.begin(),a.end()
#define vec(...) vector<__VA_ARGS__>
#define _3zlqvu8 ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}

// snuke's mod int
template <ll mod>
struct modint{
	ll x;
	modint(ll x=0):x((x%mod+mod)%mod){}
	modint operator-()const{return modint(-x);}
	modint& operator+=(const modint a){if((x+=a.x)>=mod) x-=mod; return *this;}
	modint& operator-=(const modint a){if((x+=mod-a.x)>=mod) x-=mod; return *this;}
	modint& operator*=(const modint a){(x*=a.x)%=mod; return *this;}
	modint operator+(const modint a)const{modint res(*this); return res+=a;}
	modint operator-(const modint a)const{modint res(*this); return res-=a;}
	modint operator*(const modint a)const{modint res(*this); return res*=a;}
	modint pow(ll n)const{
		modint res=1,x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modint inv()const{return pow(mod-2);}
};

using mint=modint<998244353>;

using pim=pair<int,mint>;

void slv(){
	int n,d;
	cin>>n>>d;

	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	sort(all(a));

	vi lo,hi;
	rep(i,n-1){
		if(a[i]+a[i+1]>=d){
			rng(j,i,n){
				hi.pb(a[j]);
			}
			per(j,i){
				lo.pb(a[j]);
			}
			break;
		}
	}
	if(!sz(hi)){
		print(0,mint(2).pow(n).x);
		return;
	}
	reverse(all(hi));
	const int si=sz(hi);

	vi f(si);
	mint ad=1;
	for(auto x:lo){
		bool fnd=0;
		per(i,si){
			if(hi[i]+x>=d){
				fnd=1;
				f[i]+=1;
				break;
			}
		}
		if(!fnd){
			ad*=2;
		}
	}

	vec(vec(pim)) dp(si+1,vec(pim)(si+1,pim{-1,0}));
	dp[0][0]={0,ad};
	auto push=[&](int i,int j,int val,mint wys){
		if(dp[i][j].fi<val){
			dp[i][j]={val,wys};
		}else if(dp[i][j].fi==val){
			dp[i][j].se+=wys;
		}
	};
	rng(i,1,si+1){
		int cnt=f[i-1];
		// print(cnt);
		rep(j,si+1){
			if(!dp[i-1][j].se.x) continue;
			int lhs=j,rhs=i-j-1;
			int val=dp[i-1][j].fi;
			mint wys=dp[i-1][j].se;
			// chasvi garet
			{
				push(i,j,val+lhs+cnt*max(lhs,rhs+1),wys);
			}
			// chasvi shignit
			{
				push(i,j+1,val+rhs+cnt*max(lhs+1,rhs),wys);
			}
		}
		// rep(j,si+1){
		// 	cout<<dp[i][j].fi<<" ";
		// }
		// print();
	}
	int ma=0;
	rep(j,si+1){
		ma=max(ma,dp[si][j].fi);
	}
	mint ans=0;
	rep(j,si+1){
		if(dp[si][j].fi==ma){
			ans+=dp[si][j].se;
		}
	}
	print(ma,ans.x);
}

signed main(){
_3zlqvu8;
	slv();
}