#pragma region Macros

// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/extc++.h>
// #include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// #include <atcoder/fenwicktree>
// #include <atcoder/segtree>
// #include <atcoder/maxflow>
// using namespace atcoder;

// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const ll INFL = 1LL << 61;
const int MOD = 998244353;
// const int MOD = 1000000007;

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
}

template<int mod> class modint{
public:
    int val = 0;
    modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    modint(const modint &r) { val = r.val; } // コピーコンストラクタ

    modint operator -(){ return modint(-val); } // 単項
    modint operator +(const modint &r) { return modint(*this) += r; }
    modint operator -(const modint &r) { return modint(*this) -= r; }
    modint operator *(const modint &r) { return modint(*this) *= r; }
    modint operator /(const modint &r) { return modint(*this) /= r; }

    modint &operator +=(const modint &r) {
        val += r.val;
        if (val >= mod) val -= mod;
        return *this;
    }
    modint &operator -=(const modint &r) {
        if (val < r.val) val += mod;
        val -= r.val;
        return *this;
    }
    modint &operator *=(const modint &r) {
        val = val * r.val % mod;
        return *this;
    }
    modint &operator /=(const modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % mod;
        if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const modint& r) { return this -> val == r.val; }
    bool operator <(const modint& r) { return this -> val < r.val; }
    bool operator !=(const modint& r) { return this -> val != r.val; }
};

using mint = modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}

mint modpow(const mint &a, int n) {
    if (n == 0) return 1;
    mint t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
}

int modpow(int x, int N, int mod) {
    int ret = 1;
    while (N > 0) {
        if (N % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        N /= 2;
    }
    return ret;
}

int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }

#pragma endregion

signed main() {
    int N;
    cin >> N;
    vector<int> v(N);
    vector<int> w(N);
    for (int i = 0; i < N; i++) cin >> v[i] >> w[i];

    int V;
    cin >> V;

    // 価値の総和をちょうどVにするときの、選んだwの総和の最小値
    vector<vector<int>> dp(N + 1, vector<int>(V + 1001, INFL));
    dp[0][0] = 0;

    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= V; j++) {
            if (dp[i][j] == INFL) continue;
            dp[i + 1][j + v[i]] = min(dp[i + 1][j + v[i]], dp[i][j] + w[i]);
            dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);
        }
    }
    if (dp[N][V] == 0) {
        cout << 1 << "\n" << *min_element(w.begin(),w.end()) - 1 << endl;
        return 0;
    }
    if (dp[N][V] == INFL) cout << "inf" << endl;
    else cout << dp[N][V] << endl;

    // 価値の総和をちょうどVにするときの、選んだwの総和の最大値
    vector<vector<int>> dp2(N + 1, vector<int>(V + 1001, -1));
    dp2[0][0] = 0;

    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= V; j++) {
            if (dp[i][j] == -1) continue;
            dp2[i + 1][j + v[i]] = max(dp2[i + 1][j + v[i]], dp2[i][j] + w[i]);
            dp2[i + 1][j] = max(dp2[i + 1][j], dp2[i][j]);
        }
    }
    int sum = 0;
    for (int i = 0; i < N; i++) {
        sum += w[i];
    }

    if (dp2[N][V] == sum or dp2[N][V] == -1) cout << "inf" << endl;
    else {
        // wの総和をdp2[N][V]から増やしたとき、実現できるVが変わらない上限

        // i個目まで見てwの総和がjである時の、Vの最大値
        vector<vector<int>> dp3(N + 1, vector<int>(101001, -1));
        dp3[0][0] = 0;

        for (int i = 0; i < N; i++) {
            for (int j = 0; j <= 100000; j++) {
                if (dp3[i][j] == -1) continue;
                dp3[i + 1][j + w[i]] = max(dp3[i + 1][j + w[i]], dp3[i][j] + v[i]);
                dp3[i + 1][j] = max(dp3[i + 1][j], dp3[i][j]);
            }
        }
        int ans = 0;
        for (int i = dp2[N][V]; i < 101001; i++) {
            if (dp3[N][i] > V) break;
            ans = i;
        }
        cout << ans << endl;
    }
}