/* -*- coding: utf-8 -*-
 *
 * 527.cc: No.527 ナップサック容量問題 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_W = 100000;

/* typedef */

/* global variables */

int vis[MAX_N], wis[MAX_N];
int dp[MAX_W + 1];

/* subroutines */

inline void setmax(int &a, int b) { if (a < b) a = b; }

/* main */

int main() {
  int n;
  scanf("%d", &n);

  int vsum = 0, wsum = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &vis[i], &wis[i]);
    vsum += vis[i];
    wsum += wis[i];
  }

  int maxv;
  scanf("%d", &maxv);

  if (maxv >= vsum) {
    printf("%d\ninf\n", wsum);
    return 0;
  }
  
  fill(dp, dp + MAX_W + 1, -1);
  dp[0] = 0;

  for (int i = 0; i < n; i++) {
    int &vi = vis[i], &wi = wis[i];
    for (int j = MAX_W - wi; j >= 0; j--)
      if (dp[j] >= 0) setmax(dp[j + wi], dp[j] + vi);
  }

  int i0 = -1, i1 = -1;
  for (int i = 1; i <= MAX_W; i++) {
    setmax(dp[i], dp[i - 1]);
    if (dp[i] == maxv) {
      if (i0 < 0) i0 = i;
    }
    else if (dp[i] > maxv) {
      i1 = i - 1;
      break;
    }
  }

  printf("%d\n%d\n", i0, i1);
  return 0;
}