uva12124

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
struct Node {
	int price;
	int other;
	bool operator<(const Node& a) {
		return price < a.price;
	}
};

const int INF = 1e9 + 7;
map<string, vector<Node>> mmp;
int n, b;

bool IsOk(int mid) {
	int ans = 0;
	for (auto it = mmp.begin(); it != mmp.end(); it++) {
		int num = INF;
		vector<Node>& arr = it->second;
		for (int i = 0; i < arr.size(); i++) {
			if (arr[i].other >= mid) {
				num = arr[i].price;
				break;
			}
		}
		if (num == INF) return false;
		ans += num;
	}
	return ans <= b;
}

int main()
{
	int t,p,o;
	cin >> t;
	for (int kCase = 1; kCase <= t; kCase++) {
		mmp.clear();
		string st, sn;
		cin >> n >> b;
		for (int i = 0; i < n; i++) {
			cin >> st >> sn >> p >> o;
			mmp[st].push_back(Node{ p,o });
		}
		for (auto it = mmp.begin(); it != mmp.end(); it++) {
			vector<Node>& tmp = it->second;
			sort(tmp.begin(), tmp.end());
		}

		int l = 0, r = 1e9 + 7;
		while (l < r) {
			int mid = (l + r + 1) >> 1;
			if (IsOk(mid)) {
				l = mid;
			}
			else r = mid - 1;
		}
		cout << l << endl;
	}
	return 0;
}