N = int(input())
M = 105 * 1000
inf = 10 ** 18
v, w = [0] * N, [0] * N
for i in range(N):
    v[i], w[i] = map(int, input().split())
V = int(input())
if V == sum(v):
    print(sum(w))
    print("inf")
    exit()

pre = [-inf] * M
pre[0] = 0
for i in range(N):
    dp = [-inf] * M
    for j in range(M):
        dp[j] = pre[j]
        if j - w[i] >= 0:
            dp[j] = max(dp[j], pre[j - w[i]] + v[i])
    pre, dp = dp, pre

for i in range(1, M):
    pre[i] = max(pre[i], pre[i - 1])

ans1, ans2 = 0, 0
if V == 0:
    print(1)
    print(min(w) - 1)
    exit()

for i in range(M):
    if pre[i] == V and ans1 == 0:
        ans1 = i
    if pre[i] != V and ans1 and ans2 == 0:
        ans2 = i - 1
if ans1 == 0:
    ans1 = 1
print(ans1)
print(ans2)