#include <iostream>
#include <iomanip>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> v(n), w(n);
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &v[i], &w[i]);
    }
    int mx_v;
    cin >> mx_v;

    vector<int> dp(100010, 0);

    for (int i = 0; i < n; i++) {
        for (int j = 100000 - *max_element(w.begin(), w.end()); j >= 0; j--) {
            dp[j + w[i]] = max(dp[j + w[i]], dp[j] + v[i]);
        }
    }

    if(*max_element(dp.begin(), dp.end()) == mx_v){
        for(int i = 0; i < 100000; i++){
            if(dp[i] == mx_v){
                cout << i << endl << "inf" << endl;
                return 0;
            }
        }
    }else{
        int a = 0;
        int b = 0;
        for(int i = 0; i < 100000; i++){
            if(dp[i] == mx_v){
                if(dp[i] == 0){
                    cout << 1 << endl << *min_element(w.begin(), w.end()) - 1 << endl;
                    return 0;
                }
                if(a == 0)a = i;
            }else if(a > 0 && dp[a] < dp[i]){
                cout << a << endl << i - 1 << endl;
                return 0;
            }
        }
    }
}