import sys

lim = 10**5

def solve():
    n = int(input())

    v = [0] * n
    w = [0] * n

    for i in range(n):
        vi, wi = map(int, input().split())
        v[i] = vi
        w[i] = wi

    V = int(input())

    dp = [0] * (lim + 1)

    for i in range(n):
        for j in range(lim, w[i] - 1, -1):
            dp[j] = max(dp[j], dp[j - w[i]] + v[i])

    min_a = lim + 1
    max_a = 0

    for i in range(lim + 1):
        if dp[i] == V:
            min_a = i
            break

    for i in range(lim, -1, -1):
        if dp[i] == V:
            max_a = i
            break

    print(min_a if min_a > 0 else 1)

    if sum(v) == V:
        print('inf')
    else:
        print(max_a)


if __name__ == '__main__':
    solve()