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

int main() {
    int n;
    cin>>n;
    int v[n],w[n];
    int vsum=0;
    int wsum=0;
    for (int i=0;i<n;i++) {
        cin>>v[i]>>w[i];
        vsum+=v[i];
        wsum+=w[i];
    }
    int mxv;
    cin>>mxv;
    int dp[wsum+1]{};
    for (int i=0;i<n;i++)
        for (int j=wsum;j>=w[i];j--)
            dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
    int mn=0;
    for (int i=0;i<=wsum;i++)
        if (dp[i]==mxv) {
            mn=i;
            break;
        }
    int mx=0;
    for (int i=wsum;i>=0;i--)
        if (dp[i]==mxv) {
            mx=i;
            break;
        }
    cout<<mn<<endl;
    if (dp[mx]==vsum)
        cout<<"inf"<<endl;
    else
        cout<<mx<<endl;

    return 0;
}