#include <bits/stdc++.h>
using namespace std;

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

int N,K;
int dp [101] [200001];
const int INF = 1e9;

int main()
{
	scanf("%d",&N);
	vector<int> V(N),W(N);
	FOR(i,0,N){
		scanf("%d%d",&V [i],&W [i]);
	}
	scanf("%d",&K);

	fill(dp [0],dp [N + 1],-INF);
	dp [0] [0] = 0;
	FOR(i,0,N) FOR(j,0,200001) if(dp [i] [j] >= 0){
		chmax(dp [i + 1] [j],dp [i] [j]);
		chmax(dp [i + 1] [j + W [i]],dp [i] [j] + V [i]);
	}
	FOR(i,0,200000){
		chmax(dp [N] [i + 1],dp [N] [i]);
	}

	int mn = INF,mx = -INF;
	FOR(i,1,200001) if(dp [N] [i] == K){
		chmin(mn,i);
		chmax(mx,i);
	}
	if(dp [N] [200000] == K){
		printf("%d\ninf\n",mn);
	}
	else{
		printf("%d\n%d\n",mn,mx);
	}

	return 0;
}