#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, -1);

    bool over = false;
    bool ok = false;
    dp[0] = 0;
    for(int i = 0; i < n; i++) {
        for (int j = 100000; j >= 0; j--) {
            if (dp[j] >= 0) {
                if (j + v[i] > mx_v){
                    dp[j + v[i]] = dp[j] + w[i];
                    over = true;
                }else if(j + v[i] == mx_v){
                    dp[j + v[i]] = dp[j] + w[i];
                    ok = true;
                }
                else dp[j + v[i]] = dp[j] + w[i];
            }
        }
    }

    int mx = 0;
    int tmp = -1;
    int tmp1 = -1;
    for(int i = 0; i <= 100000; i++){
       if(i <= mx_v)mx = max(mx, dp[i]);

       if(i == mx_v)tmp = dp[i];
       else if(tmp != -1 && tmp < dp[i]){
           tmp1 = dp[i];
           break;
       }
    }

    if(!ok && over)cout << 1 << endl << *min_element(v.begin(), v.end()) << endl;
    else if(ok && !over)cout << mx << endl << "inf" << endl;
    else cout << tmp << endl << tmp1 - 1 << endl;

}