#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
int W = 100005;

int main(){
    int n;
    cin >> n;
    vector<P> wv(n);
    rep(i,n){
        cin >> wv[i].second >> wv[i].first;
    }
    int V;cin >> V;
    vector<vector<int>> dp(n+1,vector<int>(W,0));

    for(int i=1;i<=n;i++){
        rep(j,W){
            if(j - wv[i-1].first >=0){
                dp[i][j] = max(dp[i-1][j],dp[i-1][j-wv[i-1].first] + wv[i-1].second);
            }else{
                dp[i][j] = dp[i-1][j];
            }
        }
    }

    int mn = INF;
    int mx = 0;
    for(int j=1;j<W;j++){
        if(dp[n][j] == V){
            mn = min(mn,j);
            mx = max(mx,j);
        }
    }

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