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

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