#include <iostream>
#include <vector>
#include <unordered_map>
#include <string>
 
using namespace std;
 
vector<pair<int, int>> v;
 
int knapsack(int n, int w) {
	if (n == 0 || w == 0) {
		return 0;
	}
 
	int weight = v[n - 1].first;
	int value = v[n - 1].second;
 
	if (weight > w) {
		return knapsack(n - 1, w);
	}
	return max(knapsack(n-1,w),knapsack(n-1,w - weight)+value);
}
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
 
	int n, w;
	cin >> n >> w;
 
	for (int i = 0; i < n; i++) {
		int w, v;
	}
 
 
 
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8dW5vcmRlcmVkX21hcD4KI2luY2x1ZGUgPHN0cmluZz4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2ZWN0b3I8cGFpcjxpbnQsIGludD4+IHY7CgppbnQga25hcHNhY2soaW50IG4sIGludCB3KSB7CglpZiAobiA9PSAwIHx8IHcgPT0gMCkgewoJCXJldHVybiAwOwoJfQoKCWludCB3ZWlnaHQgPSB2W24gLSAxXS5maXJzdDsKCWludCB2YWx1ZSA9IHZbbiAtIDFdLnNlY29uZDsKCglpZiAod2VpZ2h0ID4gdykgewoJCXJldHVybiBrbmFwc2FjayhuIC0gMSwgdyk7Cgl9CglyZXR1cm4gbWF4KGtuYXBzYWNrKG4tMSx3KSxrbmFwc2FjayhuLTEsdyAtIHdlaWdodCkrdmFsdWUpOwp9CgppbnQgbWFpbigpewoJaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwoJY2luLnRpZShudWxscHRyKTsKCQoJaW50IG4sIHc7CgljaW4gPj4gbiA+PiB3OwoKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJaW50IHcsIHY7Cgl9CgoKCQp9Cg==