#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define endl "\n"

using namespace std;
bool cmd(pair<pair<int, int>,int>a, pair<pair<int, int>,int>b)
{
	if (a.first.second != b.first.second)
	{
		return a.first.second < b.first.second;
	}
	else
	{
		return a.first.first < b.first.first;
	}
}
void solve()
{
	int n, f;
	cin >> n >> f;
	vector<pair<pair<int, int>, int>>ve;
	ve.push_back({{ -1,f },-1});
	for (int i = 1; i <= n; i++)
	{
		int l, r;
		cin >> l >> r;
		ve.push_back({{ l,r },i});
	}
	sort(ve.begin(), ve.end(),cmd);
	int flp=0;
	vector<int>anw;
	for (int i = 0; i < ve.size(); i++)
	{
		if (ve[i].first.first == -1)
		{
			flp = i;
		}
	}
	int sum = 0;
	int now = f;
	for (int i = flp+1; i < ve.size(); i++)
	{
		sum += max(0ll, ve[i].first.first- now);
		sum += ve[i].first.second - ve[i].first.first;
		now = ve[i].first.second;
		anw.push_back(ve[i].second);
	}
	for (int i = 0; i < flp; i++)
	{
		sum += max(0ll, ve[i].first.first - now);
		sum += ve[i].first.second - ve[i].first.first;
		now = ve[i].first.second;
		anw.push_back(ve[i].second);
	}
	cout << sum << endl;
	for (auto a : anw)
	{
		cout << a <<" ";
	}
	cout << endl;
}
signed main(void)
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	return 0;
}