#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define esper(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
void SOLVE(){
  int n,w;
  cin>>n>>w;
  vector<pair<int,int>>pos,neg;
  rep(i,n){
    int a,b;
    cin>>a>>b;
    if(b>=0)pos.push_back({a,b});
    else neg.push_back({a,-b});
  }
  using mint=modint998244353;
  auto calc=[](vector<pair<int,int>>a,int mx)->pair<vector<int>,vector<mint>> {
    vector<int>dp(mx+1,-1e9);
    vector<mint>ep(mx+1,0);
    dp[0]=0;
    ep[0]=1;
    for(auto [v,w]:a){
      vector<int>ndp(mx+1,-1e9);
      vector<mint>nep(mx+1,0);
      rep(i,mx+1){
        if(chmax(ndp[i],dp[i]))nep[i]=ep[i];
        else if(ndp[i]==dp[i])nep[i]+=ep[i];
        if(i+w>mx)break;
        if(chmax(ndp[i+w],dp[i]+v))nep[i+w]=ep[i];
        else if(ndp[i+w]==dp[i]+v)nep[i+w]+=ep[i];
      }
      swap(dp,ndp);
      swap(ep,nep);
      // for(int i=mx;i>=w;i--){
      //   if(dp[i-w]!=-1e9){
      //     if(chmax(dp[i],dp[i-w]+v))ep[i]=ep[i-w];
      //     else if(dp[i]==dp[i-w])ep[i]+=ep[i-w];
      //   }
      // }
    }
    return {dp,ep};
  };
  constexpr int af=10005;
  auto [pdp,pep]=calc(pos,w+af);
  auto [ndp,nep]=calc(neg,af);
  int maxndp=*max_element(all(ndp));
  mint maxep=0;
  rep(i,ndp.size())if(ndp[i]==maxndp)maxep+=nep[i];
  for(int i=ndp.size()-1;i>=1;i--){
    if(chmax(ndp[i-1],ndp[i]))nep[i-1]=nep[i];
    else if(ndp[i-1]==ndp[i])nep[i-1]+=nep[i];
  }
  int ans=-2e9;
  mint ansc=0;
  rep(i,w+1){
    if(chmax(ans,pdp[i]+maxndp))ansc=pep[i]*maxep;
    else if(ans==pdp[i]+maxndp)ansc+=pep[i]*maxep;
  }
  reps(i,w+1,w+af){
    if(chmax(ans,pdp[i]+ndp[i-w]))ansc=pep[i]*nep[i-w];
    else if(ans==pdp[i]+ndp[i-w])ansc+=pep[i]*nep[i-w];
  }
  cout<<ans<<' '<<ansc.val()<<endl;
}