#include <bits/stdc++.h>
using namespace std;

vector<int> typical_knapsack(vector<int> weight,vector<int> value,int capacity){
    int N=weight.size();
    vector<vector<int>> dp(N,vector<int>(capacity+1));
    for(int i=0;i<N;i++){
        for(int j=0;j<=capacity+1;j++){
            if(i==0){
                if(j>=weight[0]){
                    dp[i][j]=value[0];
                }else{
                    dp[i][j]=0;
                }
            }else{
                if(j>=weight[i]){
                    dp[i][j]=max(dp[i-1][j],dp[i-1][j-weight[i]]+value[i]);
                }else{
                    dp[i][j]=dp[i-1][j];
                }
            }
        }
    }
    return dp[N-1];
}


int main(){
    int N;
    cin>>N;
    vector<int> capacity(N),value(N);
    for(int i=0;i<N;i++){
        cin>>value[i]>>capacity[i];
    }
    int V;
    cin>>V;
    vector<int> ans=typical_knapsack(capacity,value,100*1000);
    int m=-1;
    int M=-1;
    for(int i=0;i<ans.size();i++){
        if(ans[i]==V && m==-1){
            m=i;
        }
        if(ans[i]>V && M==-1){
            M=i-1;
        }
    }
    cout<<m<<endl;
    if(M==-1){
        cout<<"inf"<<endl;
    }else{
        cout<<M<<endl;
    }
}