#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

int main() {
	int n;
	std::cin >> n;

	std::vector<int> v(n), w(n);
	for (int i = 0; i < n; i++) {
		std::cin >> v[i] >> w[i];
	}

	auto f = [&](int x) {
		std::vector<int> dp(x + 1, -1.01e9);
		dp[0] = 0;
		for (int i = 0; i < n; i++) {
			for (int j = x - w[i]; j >= 0; j--) {
				dp[j + w[i]] = std::max(dp[j + w[i]], dp[j] + v[i]);
			}
		}
		return *std::max_element(dp.begin(), dp.end());
	};
	int V;
	std::cin >> V;

	int L = 0;
	int R = 100001;
	while (R - L > 1) {
		int M = (L + R) / 2;
		if (f(M) >= V) {
			R = M;
		} else {
			L = M;
		}
	}
	std::cout << R << std::endl;

	L = R;
	R = 100002;
	while (R - L > 1) {
		int M = (L + R) / 2;
		if (f(M) > V) {
			R = M;
		} else {
			L = M;
		}
	}
	if (R - 1 > 100000) {
		std::cout << "inf" << std::endl;
	} else {
		std::cout << R - 1 << std::endl;
	}
}