#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
int dp[110][100010];
main(){
    int N,V,v[100],w[100];
    cin >> N;
    for(int i = 0;i < N;i++)cin >> v[i] >> w[i];
    cin >> V;
    for(int i = 0;i < N;i++){
        for(int j = 0;j <= 100000;j++){
            if(j-w[i] < 0)dp[i+1][j] = dp[i][j];
            else dp[i+1][j] = max(dp[i][j],dp[i][j-w[i]]+v[i]);
        }
    }
    cout << distance(dp[N],lower_bound(dp[N]+1,dp[N]+100001,V)) << endl;
    if(dp[N][100000] == V)cout << "inf" << endl;
    else cout << distance(dp[N],upper_bound(dp[N],dp[N]+100001,V))-1 << endl;
}