#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define ALL(v) v.begin(),v.end() typedef long long ll; template <class T> using V=vector<T>; template <class T> using VV=V<V<T>>; const int INF=1e9; const int MOD=998244353; const int geta=10000; pair<ll,ll> dp[111][30303]; int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); rep(i,111) rep(j,30303) dp[i][j]={-INF,-INF}; ll n,w; cin>>n>>w; V<ll> V(n),W(n); rep(i,n) cin>>V[i]>>W[i]; dp[0][geta]={0,1}; rep(i,n){ rep(j,30303){ if(dp[i][j].first==-INF) continue; if(dp[i+1][j].first>dp[i][j].first) ; else if(dp[i+1][j].first<dp[i][j].first) dp[i+1][j]=dp[i][j]; else dp[i+1][j].second=(dp[i+1][j].second+dp[i][j].second)%MOD; if(j+W[i]>=30303) continue; if(dp[i+1][j+W[i]].first>dp[i][j].first+V[i]) continue; else if(dp[i+1][j+W[i]].first<dp[i][j].first+V[i]) dp[i+1][j+W[i]]={dp[i][j].first+V[i],dp[i][j].second}; else dp[i+1][j+W[i]].second=(dp[i+1][j+W[i]].second+dp[i][j].second)%MOD; } } ll ma=-INF; for(int j=0;j<=geta+w;j++) ma=max(ma,dp[n][j].first); ll ans=0; for(int j=0;j<=geta+w;j++){ if(dp[n][j].first==ma) ans=(ans+dp[n][j].second)%MOD; } cout<<ma<<" "<<ans<<endl; return 0; }