#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> v(N), w(N);
	REP(i, N) scanf("%d %d", &v[i], &w[i]);
	int V;
	cin >> V;
	
	if (V == 0) {
		cout << 1 << '\n' << *min_element(ALL(w)) - 1 << endl;
		return 0;
	}
	
	vector<int> dp(V + 2, INF); // [i] := 価値 v 以上の最小容量
	dp[0] = 0;
	REP(i, N) {
		for (int j = V + 1; j >= 0; --j) {
			if (j >= v[i]) chmin(dp[j], dp[j - v[i]] + w[i]);
			if (j != V + 1) chmin(dp[j], dp[j + 1]);
		}
	}
	cout << dp[V] << endl;
	if (dp[V + 1] == INF) puts("inf");
	else cout << dp[V + 1] - 1 << endl;
}