#define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include using namespace std; using i32 = int; using i64 = long long int; using f64 = double; using str = string; template using vec = vector; template using heap = priority_queue; void in() {}; template void in(T &&x, TS &&...xs) { cin>>x; in(move(xs)...); }; template void _out(const char *sep, const char *end, T &&x) { cout< void _out(const char *sep, const char *end, T &&x, TS &&...xs) { cout<> _; return _; }() #define put(...) _out("", "", __VA_ARGS__) #define out(...) _out(" ", "\n", __VA_ARGS__) #define times(n, i) for (i32 i = 0 ; i < (n); ++i) #define range(a, b, i) for (i32 i = (a); i < (b); ++i) #define upto(a, b, i) for (i32 i = (a); i <= (b); ++i) #define downto(a, b, i) for (i32 i = (a); i >= (b); --i) #define all(xs) (xs).begin(), (xs).end() #define sortall(xs) sort(all(xs)) #define reverseall(xs) reverse(all(xs)) #define even(x) (((x) & 1) == 0) #define odd(x) (((x) & 1) == 1) #define append emplace_back #define findge lower_bound #define findgt upper_bound const i64 MOD = 1000000007; const f64 EPS = 1e-10; i64 n, m; i64 v[100], w[100]; i64 dp[101][100001]; i32 main() { in(n); i64 allw = 0; times(n, i) { in(v[i], w[i]); allw += w[i]; } in(m); upto(1, 100000, wi) { upto(1, n, ni) { if (wi >= w[ni-1]) { dp[ni][wi] = max(dp[ni-1][wi], dp[ni-1][wi-w[ni-1]] + v[ni-1]); } else { dp[ni][wi] = dp[ni-1][wi]; } } } i64 low = 0, high = 0; upto(1, allw, wi) { if (dp[n][wi] == m) { low = wi; break; } } upto(low+1, allw, wi) { if (dp[n][wi] != m) { high = wi-1; break; } } out(low); if (high < low || high == allw) { out("inf"); } else { out(high); } return 0; }