#include <iostream>
#include <algorithm>

int a[55];
void solve()
{
	int n = 0, m;
	std::cin >> n >> m;
	for (int i = 1; i <= n; i++) std::cin >> a[i];
	std::sort(a + 1, a + 1 + n );
	for (int i = n; i >= 1; i--) {
		if (m - a[i] == 0) {
			std::cout << "0" << "\n";
			return;
		}
		m -= a[i];
		if (m < 0) {
			std::cout << m + a[i] << "\n";
			return;
		}
	}
	if (m > 0)std::cout << m << "\n";
	return;
}
int main()
{
	int n;
	std::cin >> n;
	while (n--) {
		solve();
	}
	return 0;
}