#include<bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;
const int N=1e5+10;
struct node
{
	int l,r,id;
	friend bool operator<(node a,node b)
	{
		return a.l>b.l;
	}
};
struct adc
{
	int l,r,id;
}c[N];
priority_queue<node> q;
int n,f;
bool p[N];
bool cmp(adc a,adc b)
{
	return a.r>b.r;
}
void work()
{
    cin>>n>>f;
    int sum=0;
    for(int i=1;i<=n;++i)
    {
    	int l,r;
    	cin>>l>>r;
    	q.push({l,r,i});
    	c[i]={l,r,i};
    	p[i]=0;
    	sum+=r-l;
	}
	vector<int> ans;
	while(!q.empty())
	{
		auto [l,r,id]=q.top();
		q.pop();
		if(l>f) sum+=l-f,ans.push_back(id),p[id]=1;
		f=max(f,r);
	}
	sort(c+1,c+1+n,cmp);
	for(int i=1;i<=n;++i) if(!p[c[i].id]) ans.push_back(c[i].id);
	cout<<sum<<endl;
	for(int x:ans) cout<<x<<" ";
	cout<<endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T=1;
    cin>>T;
    for(;T;--T)
      work();
    return 0;
}