#include <iostream>

int n;
int v;
int max_w = 100000;
int min_cap = -1;
int main() {
    int k = 0;
    int x = 0;
    std::cin >> n;
    int dp[n+1][100001];
    int values[n];
    int weights[n];
    for (int i = 0; i < n; i++) {
        std::cin >> values[i] >> weights[i];
        k += values[i];
        x += weights[i];
    }
    std::cin >> v;
    if (v >= k) {
        std::cout << x << std::endl;
        std::cout << "inf" << std::endl;
        return 0;
    }
    
    for (int i = 0; i <= x; i++) {
        dp[0][i] = 0;
    }
    for (int i = 1; i <= n; i++) {
        for (int p = 0; p <= x; p++) {
            if (p >= weights[i-1]) {
                dp[i][p] = std::max(dp[i-1][p-weights[i-1]] + values[i-1], dp[i-1][p]);
                if (dp[i][p] >= v) {
                    if (min_cap == -1) {
                        min_cap = weights[i-1];
                    }
                }
            }
            else {
                dp[i][p] = dp[i-1][p];
            }
        }
    }
    std::cout << dp[n][x] << " " << v << std::endl;
}