#include<bits/stdc++.h>
// #include<atcoder/all>
// #include<boost/multiprecision/cpp_int.hpp>

using namespace std;
// using namespace atcoder;
// using bint = boost::multiprecision::cpp_int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ve = vector<vector<int>>;
using vb = vector<bool>;
using vvb = vector<vb>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define sz(c) ((ll)(c).size())
#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())
#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())
// #define MOD 1000000007
#define MOD 998244353
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}
ld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}



int main(){
  
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n,W;cin >> n >> W;
  vi v(n),w(n);
  rep(i,n)cin >> v[i] >> w[i];
  vector<P> dp(30100,{-MOD,-MOD});
  const int MID = 10000;
  dp[MID] = {0,1};// 価値/数え上げ
  auto ch = [](P &a,ll pv,ll pc,ll v)->void{
    if(a.first > pv + v)return ;
    if(a.first == pv + v){
      a.second = (a.second + pc)%MOD;
    }else a = {pv + v,pc};
  };
  rep(i,n){
    vector<P> DP(30100,{-MOD,-MOD});
    rep(j,30100){
      auto [pv,pc] = dp[j];
      if(pv == -MOD && pc == -MOD)continue;
      ch(DP[j],pv,pc,0);
      if(0 <= j + w[i] && j+w[i] < 30100){
        ch(DP[j+w[i]],pv,pc,v[i]);
      }
    }
    swap(dp,DP);
  }
  ll mx = -MOD;
  for(int i = W+MID;i >= 0;i--)chmax(mx,dp[i].first);
  ll res = 0;
  for(int i = 0;i <= MID + W;i++){
    if(dp[i].first == mx)res = (res + dp[i].second)%MOD;
  }
  cout << mx << " " << res << "\n";
  

  return 0;
}