#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef pair<int, int> PI;
const ll mod = 1e9 + 7;

const int N = 123;
int v[N];
int w[N];

const int W = 123456;

int dp[2][W];

int main(void){
  int n;
  cin >> n;
  REP(i, 0, n) {
    cin >> v[i] >> w[i];
  }
  int vmax;
  cin >> vmax;
  REP(i, 0, n) {
    int t = i % 2;
    REP(j, 0, W) {
      dp[1 - t][j] = 0;
    }
    REP(j, 0, W) {
      dp[1 - t][j] = dp[t][j];
      if (j >= w[i]) {
	dp[1 - t][j] = max(dp[1 - t][j], dp[t][j - w[i]] + v[i]);
      }
    }
  }
  int lo = 1e8;
  int hi = -1;
  REP(i, 1, W) {
    if (dp[n % 2][i] == vmax) {
      lo = min(lo, i);
      hi = max(hi, i);
    }
  }
  cout << lo << endl;
  if (hi < W - 1) {
    cout << hi << endl;
  } else {
    cout << "inf" << endl;
  }
}