#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll MW = 1000;
    const ll inf = LONG_LONG_MAX / 2 - 1;
    ll n;
    cin >> n;
    vector<ll> dp(n * MW + 1, -inf);
    dp[0] = 0;
    rep(i, n) {
        ll v, w;
        cin >> v >> w;
        rrep(j, sz(dp) - w + 1) {
            dp[j + w] = max(dp[j + w], dp[j] + v);
        }
    }
    ll v;
    cin >> v;
    ll minv = inf, maxv = -inf;
    reps(i, 1, sz(dp)) {
        if (dp[i] == v) {
            if (minv == inf) {
                minv = i;
            }
        }
        else if (dp[i] > v) {
            if (maxv == -inf) {
                maxv = i - 1;
            }
        }
    }
    cout << minv << endl;
    cout << ((maxv == -inf) ? "inf" : to_string(maxv)) << endl;
    return 0;
}