#include #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define o(a) cout << a << endl #define int long long #define fi first #define se second using namespace std; typedef pair P; int v[110], w[110]; int dp[100010]; signed main(){ int n, V; cin >> n; rep(i, 0, n){ cin >> v[i] >> w[i]; } cin >> V; rep(i, 0, n){ repb(j, 100000, 0){ if(j - w[i] < 0) continue; dp[j] = max(dp[j], dp[j - w[i]] + v[i]); } } int l = -1, r = 1; rep(i, 1, 100001){ if(dp[i] == V){ if(l == -1) l = i; r = i; } } l = max((int)1, l); cout << l << endl; if(r == 100000) cout << "inf" << endl; else cout << r << endl; }