#include "bits/stdc++.h"
using namespace std;
#define print(x) cout<<x<<endl;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a) for(int i=0;i<a;i++)
#define printall(n,array) for(int i=0;i<n;i++){cout<<array[i]<<" ";}cout<<endl;
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
typedef vector<int> VE;
const ll mod = 1000000007; //10^9+7

int dp[102][100003];

int main(){
  int n;  cin>>n;
  int w[1002];
  int v[1002];
  int sum_w=0;
  int sum_v=0;
  REP(i,n){
    cin>>v[i]>>w[i];
    sum_v+=v[i];
    sum_w+=w[i];
  }
  int V; cin>>V;
  if(sum_v==V){
    print(sum_w);
    print("inf");
    return 0;
  }
  int max_=0,min_=mod;
  REP(i,n)REP(j,sum_w+1){
    dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
    dp[i+1][j+w[i]]=max(dp[i+1][j+w[i]],dp[i][j]+v[i]);
  }
  REP(j,sum_w+1)if(dp[n][j]==V){
    max_=max(max_,j);
    min_=min(min_,j);
  }
  min_=min_==0?1:min_;
  print(min_);
  print(max_);
}