#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)
{
	return a.first.first < b.first.first;
}
int in[100005];
void solve()
{
	int n, f;
	cin >> n >> f;
	for (int i = 0; i <= n; i++)in[i] = 0;
	vector<pair<pair<int, int>, int>>ve, anw;
	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;
	int sum = 0;
	int now = f;
	int tp = 0;
	while (true)
	{
		for (int i = tp; i < n; i++)
		{
			if (now < ve[i].first.first)
			{
				anw.push_back(ve[i]);
				in[i] = 1;
				tp = i;
				break;
			}
			if (now < ve[i].first.second)
			{
				anw.push_back(ve[i]);
				in[i] = 1;
				now = ve[i].first.second;
			}
			if (i == n-1)
			{
				tp = n;
			}
		}
		if (tp == n)break;
		now = ve[tp].first.second;
		tp++;
	}
	now = f;
	for (int i = 0; i < ve.size(); i++)
	{
		if (in[i] == 0)anw.push_back(ve[i]);
	}
	for (int i = 0; i < ve.size(); i++)
	{
		sum += max(0ll, anw[i].first.first- now);
		sum += anw[i].first.second - anw[i].first.first;
		now = anw[i].first.second;
	}
	cout << sum << endl;
	for (auto a : anw)
	{
		cout << a.second <<" ";
	}
	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;
}