#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	const ll MAX = 100050;
	ll N; scanf("%lld", &N);
	vector<ll> v(N), w(N);
	for (ll i = 0; i < N; i++) scanf("%lld %lld", &v[i], &w[i]);
	ll V; scanf("%lld", &V);
	vector<vector<ll>> dp(N + 1, vector<ll>(MAX, -1));
	dp[0][0] = 0;
	ll sum = 0;
	for (ll i = 0; i < N; i++) {
		sum += w[i];
		for (ll j = 0; j < MAX; j++) {
			chmax(dp[i + 1][j], dp[i][j]);
			if (dp[i][j] == -1) continue;
			chmax(dp[i + 1][j + w[i]], dp[i][j] + v[i]);
		}
	}

	ll mn = INF;
	ll mx = 1;
	for (ll i = 0; i < MAX - 1; i++) {
		chmax(dp[N][i + 1], dp[N][i]);
		if (i == 0) continue;
		if (dp[N][i] == V) {
			chmin(mn, i);
			chmax(mx, i);
		}
	}
	if (mx >= sum) {
		cout << mn << "\n" << "inf" << endl;
	}
	else {
		cout << mn << "\n" << mx << endl;

	}
	return 0;
}