#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <numeric>
#include <cstring>
#define rep(i, n) for (int i = 0; i < (n); i++)

using ll = long long int;
using namespace std;
const int MAX = 100000;

int N, V;
int w[1010], v[1010], dp[110][100010];
vector<int> vec;

int main()
{
    cin >> N;
    rep(i, N)
            cin >>
        v[i] >> w[i];
    cin >> V;

    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j <= MAX; j++)
        {
            if (j + w[i] <= MAX)
            {
                dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
                dp[i + 1][j + w[i]] = max(dp[i + 1][j + w[i]], dp[i][j] + v[i]);
            }
        }
    }

    int mi = 1000000000;
    int ma = -1;
    for (int i = 1; i < 100001; i++)
    {
        if (dp[N][i] == V)
        {
            mi = min(mi, i);
            ma = max(ma, i);
        }
    }
    cout << mi << endl;
    if (ma == 100000)
        cout << "inf" << endl;
    else
        cout << ma << endl;
}