#include <iostream>
#include <vector>
#include <algorithm>
#include <tuple>
using namespace std;

long long N, W, v[5009], w[5009], v1[5009], w1[5009]; vector<pair<long long, long long>>vec, vec2;
vector<tuple<long double, int, int>>V;

int main() {
	cin >> N >> W;
	for (int i = 1; i <= N; i++) {
		cin >> v[i] >> w[i];
		V.push_back(make_tuple(1.0L*v[i] / w[i], v[i], w[i]));
	}
	sort(V.begin(), V.end()); reverse(V.begin(), V.end());
	for (int i = 0; i < V.size(); i++) {
		v[i + 1] = get<1>(V[i]);
		w[i + 1] = get<2>(V[i]);
	}
	long long sum = 0;
	for (int i = 1; i <= N; i++) {
		if (W >= 1000000000000LL * 100LL) {
			W -= w[i]; sum += v[i];
		}
		else {
			break;
		}
	}

	vec.push_back(make_pair(0, 0));
	for (int i = 1; i <= N; i++) {
		for (int j = 0; j < vec.size(); j++) {
			vec2.push_back(vec[j]);
			vec2.push_back(make_pair(vec[j].first + w[i], vec[j].second + v[i]));
		}
		sort(vec2.begin(), vec2.end()); vec.clear();
		long long maxn = -1;
		for (int j = 0; j < vec2.size(); j++) {
			if (maxn < vec2[j].second && vec2[j].first <= W) {
				maxn = vec2[j].second;
				vec.push_back(vec2[j]);
			}
		}
		vec2.clear();
		//cout << i << " " << vec.size() << endl;
	}
	long long T = 0;
	for (int i = 0; i < vec.size(); i++) { if (vec[i].first <= W) T = vec[i].second; }
	cout << sum + T << endl;
	return 0;
}