#include<iostream>
#include<cstdio>
#include<queue>
#include<deque>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MX=100010;

int T, N, M;
int stac[MX], top=0;
int read()
{
	int r=0, f=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
	while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
	return r*f;
}
struct seg
{
	int l, r, id;
	bool operator < (const seg &a)const{
		return l>a.l;
	}
}s[MX];
priority_queue<seg> q;
vector<int> o1, o2;
int main()
{
	// freopen("testdata.in","r",stdin);
	T=read();
	while(T--)
	{
		N=read(); M=read();
		for(int i=1;i<=N;i++)
		{
			int l=read(), r=read();
			q.push({l,r,i});
		}
		ll ans=0;
		int now=M;
		o1.clear(); o2.clear();
		while(!q.empty())
		{
			auto [l,r,id]=q.top(); q.pop();
			if(l<now) o2.emplace_back(id), ans+=r-l;
			else o1.emplace_back(id), ans+=r-now, now=r;
		}
		cout << ans << '\n';
		for(auto u:o1) cout << u << " ";
		reverse(o2.begin(),o2.end());
		for(auto u:o2) cout << u << " ";
		cout << '\n';
	}
	return (0-0);
}