#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 v[128], w[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] = 0;

  REP(i, N) {
    for (int j = MAX_N - 1; j - w[i] >= 0; j--) {
      chmax(dp[j], dp[j - w[i]] + v[i]);
    }
  }
  int mi = -1, ma = -1;
  for (int i = 1; i < MAX_N; i++) if (dp[i] == V) {
    if (mi == -1) mi = i;
    ma = i;
  }
  cout << mi << endl;
  if (ma >= MAX_N-1) cout << "inf" << endl; else cout << ma << endl;

  return 0;
}

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