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

using namespace std;

int n, v;
vector<int> value, weight;

int calc(int w_max) {
	vector<vector<int>> dp(n, vector<int>(w_max + 1001, -1));

	dp[0][0] = 0;
	dp[0][weight[0]] = value[0];
	for (int i = 0; i < n - 1; i++) {
		for (int j = 0; j <= w_max; j++) {
			if (dp[i][j] < 0) {
				continue;
			}
			dp[i+1][j] = max(dp[i+1][j], dp[i][j]);
			int nj = j + weight[i+1];
			dp[i+1][nj] = max(dp[i+1][nj], dp[i][j] + value[i+1]);
		}
	}

	int ret = 0;
	for (int i = 0; i <= w_max; i++) {
		ret = max(ret, dp[n - 1][i]);
	}

	return ret;
}

int main() {
	cin >> n;

	value.assign(n, 0);
	weight.assign(n, 0);
	for (int i = 0; i < n; i++) {
		cin >> value[i] >> weight[i];
	}
	cin >> v;

	int n_bit = 17;
	int maxi = 0;
	int mini = (1 << n_bit) - 1;
	for (int i = n_bit - 1; i >= 0; i--) {
		int tmp1 = maxi + (1 << i);
		int tmp2 = mini - (1 << i);
		int x = calc(tmp1);
		int y = calc(tmp2);
		if (x <= v) {
			maxi = tmp1;
		}
		if (y >= v) {
			mini = tmp2;
		}
	}

	mini = max(mini, 1);

	cout << mini << endl;
	if (maxi > 100000) {
		cout << "inf" << endl;
	} else {
		cout << maxi << endl;
	}
	return 0;
}