#include<bits/stdc++.h>

using namespace std;

typedef long long int64;

int main()
{
  int N, V;
  int dp[100002];
  fill_n(dp, 100002, -1);
  dp[0] = 0;

  cin >> N;
  for(int i = 0; i < N; i++) {
    int v, k;
    cin >> v >> k;
    for(int j = 100001 - k; j >= 0; j--) {
      if(dp[j] == -1) continue;
      dp[j + k] = max(dp[j + k], dp[j] + v);
    }
  }
  cin >> V;
  int ret = 0;
  for(int j = 1; j <= 100001; j++) {
    dp[j] = max(dp[j], dp[j - 1]);
  }

  int latte = 11451419, malta = -11451419;
  for(int i = 1; i < 100002; i++) {
    if(dp[i] == V) {
      latte = min(latte, i);
      malta = max(malta, i);
    }
  }

  if(latte >= 11451419) cout << "inf" << endl;
  else cout << latte << endl;
  if(malta < 0 || malta >= 100001) cout << "inf" << endl;
  else cout << malta << endl;
}