#include <bits/stdc++.h>

using namespace std;

int t,n,f,cur;
long long op,ext;
priority_queue<pair<int,int> > q;
vector<int> s;

struct ele
{
    int ind,l,r;
};
ele es[100001];

bool cmp(ele a,ele b)
{
    if(a.l!=b.l) return a.l<b.l;
    else return a.r>b.r;
}

void solve()
{
    op=0;
    ext=0;
    s.clear();
    cin>>n>>f;
    for(int i=1;i<=n;i+=1)
    {
        cin>>es[i].l>>es[i].r;
        op+=es[i].r-es[i].l;
        es[i].ind=i;
    }
    sort(es+1,es+n+1,cmp);
    cur=1;
    while(s.size()<n)
    {
        while(cur<=n && es[cur].l<=f) 
        {
            q.push(make_pair(es[cur].r,es[cur].ind));
            cur+=1;
        }
        if(q.size()==0)
        {
            ext+=es[cur].l-f;
            f=es[cur].r;
            s.push_back(es[cur].ind);
            cur+=1;
            continue;
        }
        if(q.top().first<f)
        {
            if(cur==n+1)
            {
                s.push_back(q.top().second);
                f=q.top().first;
                q.pop();
            }
            else 
            {
                ext+=es[cur].l-f;
                f=es[cur].r;
                s.push_back(es[cur].ind);
                cur+=1;
            }
            continue;
        }
        s.push_back(q.top().second);
        f=q.top().first;
        q.pop();
    }
    cout<<op+ext<<endl;
    for(int i=0;i<n;i+=1) cout<<s[i]<<" ";
    cout<<endl;
}

int main()
{
    cin>>t;
    while(t--) solve();
    return 0;
}