#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> v(n), w(n); REP(i, n) cin >> v[i] >> w[i];
  const int W = 100000;
  vector<vector<int> > dp(n + 1, vector<int>(W + 1, 0));
  REP(i, n) REP(j, W + 1) {
    chmax(dp[i + 1][j], dp[i][j]);
    if (j + w[i] <= W) chmax(dp[i + 1][j + w[i]], dp[i][j] + v[i]);
  }
  int V; cin >> V;
  vector<int> ans;
  REP(j, W + 1) {
    if (dp[n][j] == V) ans.emplace_back(j);
  }
  cout << ans.front() << '\n' << (ans.back() == W ? "inf" : to_string(ans.back())) << '\n';
  return 0;
}