#include <algorithm>
#include <iomanip>
#include <istream>
#include <map>
#include <numeric>
#include <ostream>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <cstring>

#define MAX_N 100000
using namespace std;

int n;
int w[100 + 1], v[100 + 1];
int dp[100 + 1][MAX_N + 1];
int V;

class Solution {
public:
    void solve(std::istream& in, std::ostream& out) {
        memset(dp, -1, sizeof(dp));
        in >> n;

        int m = 0;
        for (int i = 0; i < n; i++)
        {
            in >> v[i] >> w[i];
            m += w[i];
        }
        in >> V;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j <= V; j++)
            {
                dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
                if (j + v[i] <= V)
                {
                    dp[i + 1][j + v[i]] = max(dp[i + 1][j + v[i]], dp[i][j] + w[i]);
                }
            }
        }
        int amin = 1;
        int amax = 3;
        if (dp[n][V] != -1)
        {
            amin += dp[n][V];
            amax += dp[n][V];
            if (m <= amin)
            {
                out << amin << endl;
                out << "inf" << endl;
            }
            else
            {
                out << amin << endl;
                out << amax << endl;
            }
        }
        else
        {
            out << amin << endl;
            out << amax << endl;
        }

    }
};

void solve(std::istream& in, std::ostream& out)
{
    out << std::setprecision(12);
    Solution solution;
    solution.solve(in, out);
}


#include <fstream>
#include <iostream>


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    istream& in = cin;
    ostream& out = cout;
    solve(in, out);
    return 0;
}