#include <cstdio>
#include <algorithm>
using namespace std;

typedef pair<int,int> PII;

int n, m;
PII a[100005];

int main() {
	int T;
	scanf("%d", &T);
	for (int cas = 1; cas <= T; ++cas) {
		scanf("%d%d", &n, &m);
		int mi = -1, sum = 0;
		for (int i = 0; i < n; ++i) {
			scanf("%d%d", &a[i].first, &a[i].second);
			sum += a[i].second;
		}
		sort(a, a+n);
		for (int i = 0; i < n; ++i) {
			if (a[i].second) {
				mi = i;
				break;
			}
		}
		int emax = 0, cmin = 0;
		for (int i = 0; i < n; ++i) {
			if (a[i].first + cmin <= m) {
				emax++;
				cmin += a[i].first;
			}
		}
		if (mi != -1 && a[mi].first <= m) {
			int e = min(n, sum+1), c = a[mi].first;
			for (int i = 0; i < n && e < n; ++i) {
				if (i == mi) continue;
				if (a[i].first + c <= m) {
					e++;
					c += a[i].first;
				}
			}
			if (e > emax || e == emax && c < cmin) {
				emax = e;
				cmin = c;
			}
		}
		printf("Case %d: %d %d\n", cas, emax, cmin);
	}
}