#include<bits/stdc++.h>
#include<atcoder/modint>

using namespace std;

using mint = atcoder::modint998244353;

pair<int,mint> pairmax(pair<int,mint> a,pair<int,mint> b){
    if(b.first > a.first)swap(a,b);
    if(a.first > b.first){
        return a;
    }
    else{
        return {a.first,a.second + b.second};
    }
}

int main(){
    int inf = 2e9;
    int N,W;
    cin >> N >> W;
    vector<int> v(N+1),w(N+1);
    vector<pair<int,int>> a(N);

    //入力を受け付け、ソートする処理
    for(int i = 0;i < N;i++){
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(),a.end());
    for(int i = 1;i <= N;i++){
        v[i] = a[i-1].second;
        w[i] = a[i-1].first;
    }

    int crit = 10000;//添え字が負の値を取らないようにするためのずらし

    //DPの処理
    vector<vector<pair<int,mint>>> dp(N+1,vector<pair<int,mint>> (20001,{-inf,1}));
    pair<int,mint> ans = {0,0};
    dp[0][0+crit] = {0,1};
    for(int i = 1;i <= N;i++){
        for(int j = -10000;j <= 10000;j++)dp[i][j+crit] = dp[i-1][j+crit];
        for(int j = -10000;j <= 10000;j++){
            if(-10000 <= j - w[i] && j - w[i] <= 10000){
                if(dp[i-1][j-w[i]+crit].first != -inf)dp[i][j + crit] = pairmax(dp[i][j + crit],{dp[i-1][j-w[i] + crit].first + v[i],dp[i-1][j-w[i] + crit].second});
            }
        }
    }

    
    for(int j = -10000;j <= W;j++){
        ans = pairmax(ans,dp[N][j+crit]);
    }

    cout << ans.first << " " << ans.second.val() << endl;
    return 0;
}