#include <bits/stdc++.h>

using namespace std;

const int MAX = 111;
int N, V;
int v[MAX], w[MAX];

int dp[MAX][(int) 1e5 + 10];
// (i, j) = j:重さ


bool check(const int W, bool f) {
  memset(dp, -1, sizeof(dp));
  dp[0][0] = 0;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 1e5 + 10; j++) {
      dp[i + 1][j] = dp[i][j];
    }
    for (int j = 0; j < 1e5 + 10; j++) {
      if (dp[i][j] != -1 && j + w[i] <= W) {
        dp[i + 1][j + w[i]] = max(dp[i][j + w[i]], dp[i][j] + v[i]);
      }
    }
  }
  int ma = 0;
  for (int i = 0; i < 1e5 + 10; i++) {
    if (dp[N][i] != -1) {
      ma = max(ma, dp[N][i]);
    }
  }
  if (f) return ma <= V;
  else return ma < V;
}

int main() {
  scanf("%d", &N);
  long long sum = 0, sumw = 0;;
  for (int i = 0; i < N; i++) {
    scanf("%d%d", v + i, w + i);
    sum += v[i];
    sumw += w[i];
  }
  scanf("%d", &V);
  if (sum <= V) {
    cout << sumw << endl;
    cout << "inf" << endl;
    return 0;
  }
  int high = 1e5, low = 1;
  while (high - low > 1) {
    int mid = (high + low) / 2;
    if (check(mid, false)) low = mid;
    else high = mid;
  }
  int mi = low + check(low, false);
  high = 1e5, low = 1;
  while (high - low > 1) {
    int mid = (high + low) / 2;
    if (check(mid, true)) low = mid;
    else high = mid;
  }
  cout << mi << endl;
  cout << low << endl;
  return 0;
}