#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

const int INF = 1e9;

int dp[200000], v[100], w[100];

int main(void) {
    int i, j, N, V;
    cin >> N;
    REP (i,N) cin >> v[i] >> w[i];
    cin >> V;

    REP (i,1,199999) dp[i] = INF;
    REP (i,N) RREP (j,V,0) {
        dp[j+v[i]] = min(dp[j+v[i]], dp[j] + w[i]);
    }
    int mx = INF;
    REP (i,V+1,199999) mx = min(mx,dp[i]);
    cout << max(1,dp[V]) << endl;
    if (mx == INF)
        cout << "inf" << endl;
    else
        cout << mx-1 << endl;
    return 0;
}