#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<string> VS;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
vector<int> vx;
inline void divide() {sort(vx.begin(),vx.end());vx.erase(unique(vx.begin(),vx.end()),vx.end());}
inline int mp(int x) {return upper_bound(vx.begin(),vx.end(),x)-vx.begin();}
inline int log_2(int x) {return 31-__builtin_clz(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int lowbit(int x) {return x&-x;}
inline ll Lsqrt(ll x) { ll L = 1,R = 2e9;while(L + 1 < R){ll M = (L+R)/2;if(M*M <= x) L = M;else R = M;}return L;}
const int N = 100005;
int l[N],r[N],id[N],mr[N],mrpos[N];
bitset<N> vis;
int n; 
struct INTERVAL{
    int l,r,id;
    // bool operator<(auto a){return l<a.l;}
}p[N];
void solve()
{
    int f;
    cin>>n>>f;
    ll sum = 0;
    vector<int> ans;
    for(int i=1;i<=n;++i)
    {
        cin>>p[i].l>>p[i].r;
        p[i].id = i;
        vis[i] = 0;
        sum += p[i].r-p[i].l;
    }
    // cout<<"111:"<<sum<<'\n';
    sort(p+1, p+n+1, [](auto a,auto b){return a.l<b.l;});
    for(int i=1;i<=n;++i)
    {
        l[i] = p[i].l;
        r[i] = p[i].r;
        id[i] = p[i].id;
        if(r[i] > mr[i-1]) {mrpos[i]=i; mr[i]=r[i];}
        else mr[i]=mr[i-1], mrpos[i]=mrpos[i-1];
        // cout<<"mr "<<mr[i]<<' '<<mrpos[i]<<'\n';
    }
    int now = upper_bound(l+1, l+n+1, f)-l-1;
    // cout<<now<<' ';
    while(now < n)
    {
        f = max(f, mr[now]);
        while(mr[now] >= l[now+1] && now < n) 
        {
            vis[mrpos[now]] = 1;
            ans.push_back(id[mrpos[now]]);
            f = mr[now];
            now = upper_bound(l+1, l+n+1, f)-l-1;
        }
        if(now == n) break;
        // cout<<now<<' '<<f<<'\n';
        sum += l[now+1] - f;
        f = l[now+1];
        ++now;
    }

    vector<INTERVAL> tmp;
    for(int i=1;i<=n;++i)
    {
        if(!vis[i]) tmp.push_back(p[i]);
    }
    sort(tmp.begin(), tmp.end(), [](auto a,auto b){return a.r>b.r;});

    cout<<sum<<'\n';
    for(auto &&e:ans) cout<<e<<' ';
    for(auto &&e:tmp) cout<<e.id<<' ';
    cout<<'\n';
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		solve();
	}
}