#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,f;
int nxt[100005];
struct ss{
    int x,id;
    bool operator <(const ss ot)const{
        if(x==ot.x)return id<ot.id;
        return x<ot.x;
    }
}l[100005],r[100005];
int fa[100005];
int find(int x)
{
    if(x==fa[x])return x;
    return fa[x]=find(fa[x]);
}
void merge(int x,int y)
{
    x=find(x);y=find(y);
    fa[x]=y;
}
set<ss> s;
ss get(ss x)
{
    auto it=s.lower_bound(x);
    if(it==s.end())
    {
        it--;
        if(find(x.id)==find(it->id))
            it--;
        return *it;
    }
    else
    {
        if(find(x.id)==find(it->id))
            it++;
        if(it==s.end())
        {
            it--;
            it--;
        }
        return *it;
    }
}
void solve(void)
{
    cin>>n>>f;
    s.clear();
    int ans=0;
    for(int i=0;i<=n;i++)
        fa[i]=i;
    for(int i=1;i<=n;i++)
    {
        cin>>l[i].x>>r[i].x;
        nxt[i]=0;
        l[i].id=r[i].id=i;
        ans+=r[i].x-l[i].x;
        s.insert(r[i]);
    }
    sort(r+1,r+n+1);
    sort(l+1,l+n+1);
    s.insert((ss){f,0});
    int vis0=0;
    for(int i=n;i>=1;i--)
    {
        ss t=get(l[i]);
        if(i==1&&t.id!=0&&!vis0)
        {
            s.erase(t);
            t=get(l[i]);
        }
        if(!t.id)vis0=1;
        nxt[t.id]=l[i].id;
        merge(t.id,l[i].id);
        //cerr<<l[i].id<<" "<<t.id<<endl;
        ans+=max(l[i].x-t.x,0ll);
        s.erase(t);
    }
    cout<<ans<<'\n';
    int now=nxt[0];
    while(now)
   {
    cout<<now<<" ";
    now=nxt[now];
   }
   cout<<'\n';
   return;
}
signed main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}