#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

#define INF 100002

int N;
int v[105];
int w[105];
int V;

bool C(int W){
  vector<int> dp(W+1, -1);
  dp[0] = 0;
  rep(i,N){
    for(int j=W; j>=0; j--){
      if(dp[j]>=0 && j+w[i]<=W){
        dp[j+w[i]] = max(dp[j+w[i]], dp[j] + v[i]);
      }
    }
  }
  int ret = 0;
  rep(i,dp.size()){
    ret = max(ret, dp[i]);
  }
  return ret < V;
}
bool C2(int W){
  vector<int> dp(W+1, -1);
  dp[0] = 0;
  rep(i,N){
    for(int j=W; j>=0; j--){
      if(dp[j]>=0 && j+w[i]<=W){
        dp[j+w[i]] = max(dp[j+w[i]], dp[j] + v[i]);
      }
    }
  }
  int ret = 0;
  rep(i,dp.size()){
    ret = max(ret, dp[i]);
  }
  return ret == V;
}

int main(){
  cin >> N;
  rep(i,N){
    cin >> v[i] >> w[i];
  }
  cin >> V;

  int ret_min, ret_max;
  {
    int lb = 0, ub = INF;
    while(ub-lb>1){
      int m = (lb+ub)/2;
      if(C(m)) lb = m;
      else ub = m;
    }
    ret_min = ub;
  }
  {
    int lb = ret_min, ub = INF;
    while(ub-lb>1){
      int m = (lb+ub)/2;
      if(C2(m)) lb = m;
      else ub = m;
    }
    ret_max = lb;
  }

  cout << ret_min << endl;
  if(ret_max > 100000){
    cout << "inf" << endl;
  }else{
    cout << ret_max << endl;
  }
  
  return 0;
}