#include<bits/stdc++.h>

using namespace std;

pair<int,int> pairmax(pair<int,int> a,pair<int,int> b){
    if(b > a)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);
    for(int i = 1;i <= N;i++){
        cin >> v[i] >> w[i];
    }
    int crit = 1000;
    vector<vector<pair<int,int>>> dp(N+1,vector<pair<int,int>> (2001,{-inf,1}));
    for(int i = 0;i <= N;i++){
    for(int j = -1000;j < 0;j++){
        dp[i][j+crit] = {-inf,0};
    }
    }
    pair<int,int> ans = {0,0};
    dp[0][0+crit] = {0,1};
    for(int i = 1;i <= N;i++){
        for(int j = -1000;j <= 1000;j++)dp[i][j+crit] = dp[i-1][j+crit];
        for(int j = -1000;j <= 1000;j++){
            if(-1000 <= j - w[i] && j - w[i] <= 1000){
                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 = -1000;j <= W;j++){
        ans = pairmax(ans,dp[N][j+crit]);
    }



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