#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main() {
  ll INF = 1000000000000000000;
  ll n;std::cin >> n;
  vvl dp = VV(n+1, 100001, -INF, ll);
  dp[0][0] = 0;
  re(i, n){
    ll a, b;std::cin >> a >> b;
    for(int j=0;j<=100000;j++){
      dp[i+1][j] = max({dp[i+1][j], dp[i][j], (j==0?0:dp[i+1][j-1])});
      if(j+b<=100000) dp[i+1][j+b] = max(dp[i+1][j+b], dp[i][j] + a);
    }
  }
  ll V;std::cin >> V;
  ll l = 1000000000000000000, r = -1000000000000000000;
  for(ll i=0;i<=100000;i++) if(dp[n][i]==V) l = min(l, i), r = max(r, i);
  std::cout << max(l, 1LL) << '\n';
  std::cout << (r==100000?"inf":to_string(r)) << '\n';
}