#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll N;

int main(){
    
    ll N;
    cin >> N;

    vector<pair<ll, ll > > vec;

    ll sum_v = 0;
    ll min_w = 1145141919;
    for(ll i = 0; i < N; i++){
        ll v, w;
        cin >> v >> w;
        vec.push_back(make_pair(v, w));
        sum_v += v;
        if(min_w > w) min_w = w;
    }

    sort(vec.begin(), vec.end());

    ll V;
    cin >> V;

    //DP
    map<ll, ll> dp;
    dp[0] = 0;
    for(ll i = 0; i < N; i++){
        //読み出し
        vector<pair <ll, ll > > tmp;
        auto begin = dp.begin(), end = dp.end();
        for (auto iter = begin; iter != end; iter++) {
            tmp.push_back(make_pair(iter->first, iter->second));
            if(vec[i].first + iter->first <= sum_v){
                tmp.push_back(make_pair(vec[i].first + iter->first, vec[i].second + iter->second));
            }
        }
        //更新 first = 価値 second = 重さ
       //更新
        for (ll j = 0; j < tmp.size(); j++) {
            dp[tmp[j].first] = max(tmp[j].second, dp[tmp[j].first]);
        }  
    }

    ll min_contain = 1;
    ll max_contain = min_w - 1;
    auto begin = dp.begin(), end = dp.end();
    for (auto iter = begin; iter != end; iter++) {
        //cout << iter->first << " " << iter->second << endl;
        if(iter->first == V && V != 0){
            min_contain = iter->second;
        }else if(iter->first > V && V != 0){
            max_contain = iter->second - 1;
            break;
        }
    }

    if(min_contain > max_contain){
        cout << min_contain << endl;
        cout << "inf" << endl;
    }else{
        cout << min_contain << endl;
        cout << max_contain << endl;
    }

    

}