#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#include <math.h>
#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 RREP1(i, n) for (ll i = n; i >= 1; i--)
#define FOR(i, a, b, c) for (ll i = a; i <= b; i += c)
#define RFOR(i, a, b, c) for (ll i = a; i >= b; i -= c)
#define MAX(a, b) (a > b ? a : b)
#define MIN(a, b) (a < b ? a : b)
#define MAX3(a, b, c) MAX(MAX(a, b), c)
#define MIN3(a, b, c) MIN(MIN(a, b), c)
#define SORT(t, a, n) qsort(a, n, sizeof(t), ({ int _f (const void *_a, const void *_b) { return *(t *)_a - *(t *)_b; } _f; }))
#define RSORT(t, a, n) qsort(a, n, sizeof(t), ({ int _f (const void *_a, const void *_b) { return *(t *)_b - *(t *)_a; } _f; }))
#define SUM(a, n) ({ ll _s = 0; REP(_i, n) _s += a[_i]; _s; })
#define PROD(a, n) ({ ll _p = 1; REP(_i, n) _p *= a[_i]; _p; })
#define CNT(x, a, n) ({ ll _c = 0; REP(_i, n) if (a[_i] == x) _c++; _c; })
#define MAXM(t, a, n) ({ t _m = a[0]; REP(_i, n) _m = MAX(_m, a[_i]); _m; })
#define MINM(t, a, n) ({ t _m = a[0]; REP(_i, n) _m = MIN(_m, a[_i]); _m; })
#define INF 1073709056
#define LLINF 4611686016279904256LL
typedef long long ll;

int n, v;
int vs[114], ws[114];

int knapsack(int w) {
    static int dp[114][100001];
    REP1(i, n) {
        REP(j, w + 1) {
            if (ws[i] <= j) dp[i][j] = MAX(dp[i - 1][j], dp[i - 1][j - ws[i]] + vs[i]);
            else dp[i][j] = dp[i - 1][j];
        }
    }
    return dp[n][w];
}

int main() {
    scanf("%d", &n);
    REP1(i, n) scanf("%d %d", &vs[i], &ws[i]);
    scanf("%d", &v);

    if (SUM((vs + 1), n) == v) {
        int min = SUM((ws + 1), n);
        printf("%d\ninf\n", min);
        return 0;
    }

    int min = 1, max = 100000;
    while (true) {
        int w = (min + max) / 2;
        int v_tmp = knapsack(w);
        if (v_tmp < v) min = w;
        else if (v_tmp > v) max = w;
        else break;
    }
    FOR(i, min, 100000, 1) {
        if (knapsack(i) > v) {
            max = i - 1;
            break;
        }
    }
    RFOR(i, max, 1, 1) {
        if (knapsack(i) < v) {
            min = i + 1;
            break;
        }
    }
    printf("%d\n%d\n", min, max);
    return 0;
}