#include <bits/stdc++.h>
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> bool inside(T l,T x,T r){return l<=x&&x<r;}

#include <atcoder/modint>
using mint = atcoder::modint998244353;

void solve();
// CYAN / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    const int L = 20202;
    int N, W;
    cin >> N >> W;
    vector<pair<ll, mint>> dp1(L, {-ILL, 0}), dp2(L, {-ILL, 0});
    dp1[0] = {0, 1};
    dp2[0] = {0, 1};
    auto op = [&](pair<ll, mint> &a, pair<ll, mint> b) -> void {
        if (chmax(a.first, b.first)) a.second = 0;
        if (a.first == b.first) a.second += b.second;
    };
    rep(rp, 0, N){
        int u, w;
        cin >> u >> w;
        for (int j = L - 1; j >= abs(w); j--){
            auto tmp = dp1[j - abs(w)];
            if (w >= 0){
                tmp.first += u;
                op(dp1[j], tmp);
            }
            else{
                tmp = dp2[j + w];
                tmp.first += u;
                op(dp2[j], tmp);
            }
        }
    }
    pair<ll, mint> ans = {-ILL, 0};
    pair<ll, mint> sum = {-ILL, 0};
    for (int j = L - 1; j >= 0; j--){
        int ind = W - j;
        ind *= -1;
        if (inside(0, ind, L)) op(sum, dp2[ind]);
        op(ans, {sum.first + dp1[j].first, sum.second * dp1[j].second});
    }
    cout << ans.first << " " << ans.second.val() << "\n";
}