#include #define rep(i,a,b) for(int i=a;i> N; rep(i, 0, N) cin >> v[i] >> w[i]; cin >> V; rep(i, 0, N) rep(j, 0, 100002) { dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]); dp[i + 1][j + w[i]] = max(dp[i + 1][j + w[i]], dp[i][j] + v[i]); } int mi = INT_MAX; int ma = -1; rep(j, 1, 100002) if (dp[N][j] == V) { mi = min(mi, j); ma = max(ma, j); } cout << mi << endl; if (ma == 100001) cout << "inf" << endl; else cout<< ma << endl; }