#include <bits/stdc++.h>

#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;
constexpr int MAX = 100;
constexpr int WMAX = 100000;
constexpr int VMAX = 100000;

constexpr int INF = numeric_limits<int>::max() / 10;

pii p[MAX];
int dp[MAX + 1][VMAX + 2];  // min weight i~ nolessthan v

int main()
{
    int N;
    cin >> N;
    rep(i, N)
    {
        cin >> p[i].first >> p[i].second;
    }
    int V;
    cin >> V;
    for (int v = V + 1; v >= 1; v--) {
        dp[N][v] = INF;
    }
    dp[N][0] = 0;
    for (int n = N - 1; n >= 0; n--) {
        for (int v = V + 1; v >= 0; v--) {
            if (v <= p[n].first) {
                dp[n][v] = min(dp[n + 1][v], p[n].second);
            } else {
                dp[n][v] = min(dp[n + 1][v], dp[n + 1][v - p[n].first] + p[n].second);
            }
        }
    }
    int vmin = dp[0][V];
    int vmax = dp[0][V + 1];
    cout << max(1, vmin) << endl;
    if (vmax == INF) {
        cout << "inf" << endl;
    } else {
        cout << vmax - 1 << endl;
    }

    return 0;
}