n = int(input())
N = 10**5+1
dp = [0]*N
for _ in range(n):
    v,w = map(int,input().split())
    for i in range(w,N)[::-1]: dp[i] = max(dp[i],dp[i-w]+v)
V = int(input())
print(max(1,dp.index(V)))
print("inf" if dp[-1]==V else N - dp[::-1].index(V) - 1)