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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
template<class T>bool chmin(T&a,const T&b){return a>b?(a=b,true):false;}
template<class T>bool chmax(T&a,const T&b){return a<b?(a=b,true):false;}

int nextInt() {
  int x; scanf("%d", &x); return x;
}

int w[128];
int v[128];

const int INF = 1001001001;
const int MAX_N = 100010;
int dp[MAX_N];

int main2() {
  int N = nextInt();
  REP(i, N) {
    v[i] = nextInt();
    w[i] = nextInt();
  }
  int V = nextInt();
  REP(i, MAX_N) dp[i] = INF;
  dp[0] = 0;

  REP(i, N) {
    for (int j = MAX_N - 1; j - v[i] >= 0; j--) {
      chmin(dp[j], dp[j - v[i]] + w[i]);
    }
  }

  // REP(i, 20) {
    // cout << i << ":" << dp[i] << endl;
  // }

  int mi = max(1, dp[V]);
  int ma = mi;
  for (ma = mi + 1; ma < MAX_N; ma++) {
    if (dp[ma] != INF) {
      ma--;
      break;
    }
  }
  cout << mi << endl;
  if (ma >= MAX_N) cout << "inf" << endl; else cout << ma << endl;
  return 0;
}

int main() {
  for (;!cin.eof();cin>>ws) main2();
  return 0;
}