//#define LOCAL

#include <fstream>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <cstring>
#include <climits>
#include <set>

//#define int long long
//typedef long long ll;
using ll = long long;
using R = double;

//#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)

#define MOD 1000000007

using namespace std;

//typedef vector<int> V;
//typedef vector<V> VV;

int N;
int v[110], w[110];
int V;

int dp[110][100010];

int rec(int i, int j)
{
    if (dp[i][j] >= 0) {
        return dp[i][j];
    }

    int res;
    if (i == N) {
        res = 0;
    } else if (j < w[i]) {
        res = rec(i + 1, j);
    } else {
        res = max(rec(i + 1, j), rec(i + 1, j - w[i]) + v[i]);
    }

    return dp[i][j] = res;
}

signed main()
{
#ifdef LOCAL
    ifstream in("input.txt");
    cin.rdbuf(in.rdbuf());
#endif

    cin >> N;
    REP(i,N) cin >> v[i] >> w[i];
    cin >> V;

    //最小値
    int lb = 0, ub = 100010;
    while (ub - lb > 1) {
        int mid = (lb + ub) / 2;
        memset(dp, -1, sizeof(dp));
        if (rec(0, mid) >= V) ub = mid;
        else lb = mid;
    }
    cout << ub << endl;

    //最大値
    lb = 0, ub = 100010;
    while (ub - lb > 1) {
        int mid = (lb + ub) / 2;
        memset(dp, -1, sizeof(dp));
        if (rec(0, mid) <= V) lb = mid;
        else ub = mid;
    }
    if (lb > 100005) {
        cout << "inf" << endl;
    } else {
        cout << lb << endl;
    }

    return 0;
}