#include <iostream>
#include <vector>

using namespace std;
using vi = vector<int>;

#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)

constexpr int MAX_V = 1e5+2;
int dp[101][MAX_V];
int main() {
  int N; cin >> N;

  vi v(N), w(N);
  rep(i, N)
    cin >> v[i] >> w[i];
  int V; cin >> V;


  // dp[i][v] = i番目までで価値の総和がちょうどvのときの容量の最小値
  rep(i, N+1) rep(j, MAX_V) {
    dp[i][j] = -1;
  }
  dp[0][0] = 0;
  rep(i, N) rep(j, MAX_V) {
    dp[i+1][j] = dp[i][j];
    if (dp[i][j-v[i]] == -1)
      continue;
    if (dp[i+1][j] == -1)
      dp[i+1][j] = dp[i][j-v[i]] + w[i];
    else
      dp[i+1][j] = min(dp[i+1][j], dp[i][j-v[i]] + w[i]);
  }

  cout << max(1, dp[N][V]) << endl;
  if (dp[N][V+1] == -1)
    cout << "inf\n";
  else
    cout << dp[N][V+1]-1 << endl;

  return 0;
}