#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<functional>
#include<cmath>
using namespace std;
int n, v[100], w[100], dp[102000], V;
int main() {
	cin >> n; for (int j = 0; j < 102000; j++)dp[j] = -1e9;
	dp[0] = 0;
	for (int i = 0; i < n; i++) {
		cin >> v[i] >> w[i];
		for (int j = 100000; j >= 0; j--) {
			if (dp[j] >= 0)dp[j + w[i]] = max(dp[j + w[i]], dp[j] + v[i]);
		}
	}
	for (int i = 1; i <= 101999; i++)dp[i] = max(dp[i], dp[i - 1]);
	cin >> V;
	int minx = 1e9, maxn = -1e9;
	for (int i = 1; i < 102000; i++) {
		if (dp[i] == V) { minx = min(minx, i); maxn = max(maxn, i); }
	}
	if (maxn == 101999)cout << minx << endl << "inf" << endl;
	else cout << minx << endl << maxn << endl;
	return 0;
}