// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>

#define int long long

using namespace std;

map<pair<int, int>, int> mmap;

bool cmp_second(const pair<int, int> &a, const pair<int, int> &b) {
	return a.second < b.second;
}

bool cmp_first(const pair<int, int> &a, const pair<int, int> &b) {
	if (a.first == b.first) {
		if (mmap.find(a) == mmap.end() || mmap.find(b) == mmap.end()) {
			assert(1==2);
		}
		return mmap[a] < mmap[b];
	}
	
	return a.first < b.first;
}

pair<bool, int> works(int m, vector<pair<int, int>> &arr, int smax) {
	priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(&cmp_first)> small(cmp_first), big(cmp_first);

	if (smax == 0) {
		return make_pair(true, -1);
	}

	vector<int> dp((int) arr.size());

	int running = 0;

	for (int i = (int) arr.size() - 1; i >= 0; i--) {
		dp[i] = running;
		big.push(arr[i]);
		running += arr[i].first;

		while ((int) big.size() > max(0LL, ((i == 0 ? 0 : arr[i - 1].second) - m))) {
			running -= big.top().first; big.pop();
		}
	}

	int running2 = 0; // less than

	for (int i = 0; i < (int) arr.size(); i++) {
		if ((i + 1 >= m) && (running2 + dp[i] + arr[i].first <= smax) && (max(0LL, arr[i].second - m) + i < (int) arr.size())) {
			return {true, i};
        }

		small.push(arr[i]);
		running2 += arr[i].first;

        while ((int) small.size() >= m) {
			running2 -= small.top().first; small.pop();
        }
	}

	return {false, -1};
}

void print_ans(int ans, int m, vector<pair<int, int>> &arr) {
	cout << m << "\n";
	cout << (m + max(0LL, (ans == -1 ? 0 : arr[ans].second) - m)) << "\n";

	if ((m + max(0LL, (ans == -1 ? 0 : arr[ans].second) - m)) == 0) {
		return;
	}

	cout << mmap[arr[ans]] + 1 << " ";

	priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(&cmp_first)> small(cmp_first), big(cmp_first);

	for (int i = 0; i < ans; i++) {
		small.push(arr[i]);

        while ((int) small.size() >= m) {
			small.pop();
        }
	}

	set<int> p;
	
	while (!small.empty()) {
		cout << mmap[small.top()] + 1 << " "; small.pop();
	}

	for (int i = (int) arr.size() - 2; i >= ans; i--) { // so i don't have to commit a war crime like in bsearch validation functoin
		big.push(arr[i + 1]);

        while ((int) big.size() > max(0LL, arr[i].second - m)) {
            big.pop();
        }
	}

	while (!big.empty()) {
		cout << mmap[big.top()] + 1 << " "; big.pop();
	}

	cout << "\n";
}

signed main() {
	cin.tie(0) -> sync_with_stdio(0);

	int T; cin >> T;

	while (T--) {
		int N, M; cin >> N >> M;

		vector<pair<int, int>> arr(N); // a, b

		mmap.clear();

		for (int i = 0; i < N; i++) {
			cin >> arr[i].first >> arr[i].second;
			mmap[arr[i]] = i;
		}

		sort(arr.begin(), arr.end(), cmp_second);

		// for (auto p : arr) {
		// 	cout << p.first << " " << p.second << "\n";
		// }

		int l = 0, r = N;

		int ans = -1;

		while (l < r) {
			int m = l + (r - l + 1) / 2;

			auto asdkljasdlfasd = works(m, arr, M);

			if (asdkljasdlfasd.first) {
				l = m; ans = asdkljasdlfasd.second;
			} else {
				r = m - 1;
			}
		}

		print_ans(ans, l, arr);
	}
}