1111

#include <bits/stdc++.h>
using namespace std;
int n, l, dp[2000005] = {0}, m, sc, s, w[505], c[505];
int main() {
	cin >> n >> l;
	for (int i = 1; i <= n; i++) {
		cin >> w[i] >> c[i];
		sc += w[i];
		s += c[i];
	}
	if (s < l) {
		cout << "no solution";
		return 0;
	}
	m = s - l;
	for (int i = 1; i <= n; i++) {
		for (int j = m; j >= w[i]; j--)
			dp[j] = max(dp[j], dp[j - w[i]] + c[i]);
	}
	cout << sc - dp[m];
}