#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
constexpr int MX = 100003;
int dp[MX];

int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    int n; cin >> n;
    rep(i, n) {
        int v, w; cin >> v >> w;
        for(int j = MX-1; j-w >= 0; j--) {
            chmax(dp[j], dp[j-w] + v);
        }
    }
    int V; cin >> V;
    int mn = INF;
    int mx = 0;
    FOR(i,1,MX-1) {
        if(dp[i] == V) {
            // cout << i << endl;
            chmin(mn, i);
            chmax(mx, i);
        }
    }

    cout << mn << endl;
    if(mx <= 100000) cout << mx << endl;
    else cout << "inf" <<  endl;
    return 0;
}