#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int N, V;

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin >> N;
    struct I { int v; int w; };
    vector<I> ITEMS(N);
    
    REP(i, N) cin >> ITEMS[i].v >> ITEMS[i].w;
    int allW = accumulate(ITEMS.begin(), ITEMS.end(), 0, bind(plus<int>(), std::placeholders::_1, bind(&I::w, std::placeholders::_2)));
    
    cin >> V;
    
    vector< vector<int> > DP(N, vector<int>(allW+1, 0));
    
    REP(i, N) REP(w, allW+1) {
        auto item = ITEMS[i];
        if (i > 0) {
            DP[i][w] = DP[i-1][w];
            if (w >= item.w) {
                DP[i][w] = max(DP[i][w], DP[i-1][w-item.w] + item.v);
            }
        } else {
            if (w >= item.w) {
                DP[i][w] = item.v;
            }
        }
    }
    
    int minW = LONG_MAX;
    int maxW = 0;
    
    FOR(w, 1, allW+1) {
        if (DP[N-1][w] != V) continue;
        maxW = max(maxW, w);
        minW = min(minW, w);
    }
    
    cout << minW << endl;
    if (maxW == allW) {
        cout << "inf" << endl;
    } else {
        cout << maxW << endl;
    }

    return 0;
}