#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<25
#define pb push_back
 
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
int v[101],w[101],dp[100001];//重さのMAX価値を保存
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>v[i]>>w[i];
		for(int j=100000;j>=0;j--){
			dp[j+w[i]]=max(dp[j+w[i]],dp[j]+v[i]);
		}
	}	
	int max_v,mn=100001,mx=0;
	cin>>max_v;
	for(int i=0;i<=100001;i++){
		if(dp[i]==max_v){
			mn=min(mn,i);
			mx=max(mx,i);
		}		
	}
	if(mx==100001){
		cout<<max(mn,1)<<endl;
		cout<<"inf\n";
	}
	else{
		cout<<max(mn,1)<<endl;
		cout<<mx<<endl;
	}
	
}