#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N=5e5+10,M=2*N;
//const int mod=998244353;
const LL mod=1e9+7;
const LL INF=1e18+7;
//LL h[N],e[M],ne[M],idx;
int T=1;
struct nd
{
    int l,r,id;
    bool operator < (const nd& t) const{
        return r<t.r;
    }
};


struct nod
{
    int first,second,id;
    bool operator < (const nod& t) const{
        return first<t.first;
    }
};

void solve(){
    int n,f;

    cin>>n>>f;

    vector<nod> a(n);

    for(int i=0;i<n;i++){
        int l,r;
        cin>>l>>r;
        a[i]={l,r,i};
    }


    sort(a.begin(),a.end());


    priority_queue<nd,vector<nd> > q;

    int nw=0;
    for(nw=0;nw<n;nw++) 
        if(a[nw].first<=f) q.push({a[nw].first,a[nw].second,a[nw].id});
        else break;

    LL res=0;
    vector<int> ans;
    

        
        
    if(nw==0&&a[nw].first>f) res+=a[nw].first-f,q.push({a[nw].first,a[nw].second,a[nw].id}),nw++;
        

    //cout<<nw<<endl;
    while(q.size()){
        
        auto t=q.top();
        q.pop();

        LL l=t.l,r=t.r;
        //cout<<l<<" "<<r<<" "<<nw<<" "<<f<<endl;
        if(f>r&&nw<n){
            if(nw<n&&a[nw].first>f) res+=a[nw].first-f,q.push({a[nw].first,a[nw].second,a[nw].id}),nw++;
            q.push(t);
            continue;
        }

        res+=r-l;
        f=r;
        ans.push_back(t.id);

        while(nw<n&&a[nw].first<=f) q.push({a[nw].first,a[nw].second,a[nw].id}),f=max(f,a[nw].second),nw++;
        
        if(nw<n&&a[nw].first>f) res+=a[nw].first-f,q.push({a[nw].first,a[nw].second,a[nw].id}),nw++;
    }
    cout<<res<<endl;
    for(auto t:ans) cout<<t+1<<" ";
    cout<<endl;
}
 
 
 int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>T;
    
    while(T--) solve();
 
    return 0;
}