#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

int main(int argc, char *argv[])
{
	int n, v[100], w[100], sum = 0, mv;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> v[i] >> w[i];
		sum += w[i];
	}
	cin >> mv;
	int dp[100001];
	memset(dp, -1, sizeof(dp));
	int low = -1, high = 0;
	for (int t = 1; t <= sum; ++t) {
		memset(dp, -1, (t + 1) * sizeof(int));
		dp[0] = 0;
		int z = 0;
		for (int i = 0; i < n; ++i) {
			for (int j = t; j >= w[i]; --j) {
				int k = dp[j - w[i]];
				if (k >= 0) {
					dp[j] = max(dp[j], k + v[i]);
				}
			}
		}
		int mm = 0;
		for (int i = 0; i <= t; ++i) {
			mm = max(mm, dp[i]);
		}
		if (mm == mv) {
			if (low < 0) {
				low = t;
			}
			high = t;
		} else if (mm > mv) {
			break;
		}
	}
	cout << low << endl;
	if (high == sum) {
		cout << "inf" << endl;
	} else {
		cout << high << endl;
	}
	return 0;
}