#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	int N;
	cin >> N;
	vector<int> V(N),W(N);
	for(int i=0;i<N;++i){
		cin >> V[i] >> W[i];
	}
	int TER;
	cin >> TER;//探す値価値の最大値
	const int dp_max = 100000;
	vector<int> dp(dp_max + 1,-1);
	dp[0] = 0;//重さ0で価値0
	for(int i=0;i<N;++i){
		for(int w=dp_max;w>=0;--w){
			if( dp[w] >= 0 ){
				dp[w+W[i]] = max(dp[w+W[i]],dp[w]+V[i]);
			}
		}
	}
	int L,R;
	L = INF;
	R = INF;
	for(int w=0;w<=dp_max;++w){
		if( dp[w] == TER ){
			L = min(L,w);//必ずある
		}
		if( dp[w] > TER ){
			R = min(R,w);
		}
	}
	if( L == 0 ){
		cout << 1 << endl;
	}else{
		cout << L << endl;
	}
	if( R == INF ){
		cout << "inf" << endl;
	}else{
		cout << R-1 << endl;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()