#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N; cin >> N;
	vector<int> v(N), w(N); rep(i, 0, N) { cin >> v[i] >> w[i]; }
	int V; cin >> V;
	vector<int>dp(111111, 0);
	rep(i, 0, N)rrep(j, w[i], dp.size())
		chmax(dp[j], dp[j - w[i]] + v[i]);
	int m = distance(dp.begin(), lower_bound(1 + all(dp), V));
	dump(m);
	int M;
	int i;
	dump(dp[m]);
	dump(dp[dp.size() - 1]);
	for (i = m;i<dp.size() &&dp[i] == V; i++);
	cout << m << endl;
	if (i == dp.size())cout << "inf" << endl;
	else cout << i - 1 << endl;

	return 0;
}