#include <iostream>
#include <string>
using namespace std;


int main(void){
    int n, maxV,v[101],w[101], dp[101][100001],minW=1000000,maxW=0,tmp2W,tmpW;
    cin >> n;
    for(int i=0;i<n;i++){
        cin >> v[i] >> w[i];
    }
    cin >> maxV;
    for(int i=0;i<=100000;i++){
        dp[n][i] = 0;
    }
    for(int i=n-1;i >=0;i++){
        for(int j=0;j<=100000;j++){
            if(j<w[i]){
                dp[i][j] = dp[i+1][j];
            }else{
                dp[i][j] = min(dp[i+1][j], dp[i+1][j-w[i]]+v[i]);
            }
        }
    }
    for(int i=1; i<n; i++){
        for(int j=0; j<=100000; j++){
            if(dp[i][j] == maxV){
                tmpW = j;
                tmp2W = j;
                if(tmpW < minW){
                minW = tmpW;
	            }
	            if(tmp2W > maxW){
	                maxW = tmp2W;
	            }
            }
        }
    }
    cout << minW << endl;
    cout << maxW << endl;
    return 0;
}