#include <bits/stdc++.h>
#define int long long
using namespace std;

struct node{
    int l,r,id;
};

bool cmp(const node& a,const node& b){
    if(a.r==b.r){
        return a.l>b.l;
    }
    return a.r<b.r;
}

void solve(){
    int n,f;
    cin>>n>>f;
    vector<node> a(n);
    int mxr=0,cost=0;
    int mxid;
    int sum=0;
    for(int i=0;i<n;i++){
        int l,r;
        cin>>l>>r;
        sum+=r-l;
        a[i].l=l,a[i].r=r;
        a[i].id=i+1;
        if(r==mxr){
            if(max(l-f,0ll)<cost){
                cost=max(l-f,0ll);
                mxid=i+1;
            }
        }
        else if(r>mxr){
            mxr=r;
            cost=max(l-f,0ll);
            mxid=i+1;
        }
    }
    sort(a.begin(),a.end(),cmp);
    int ans=cost+sum;
    cout<<ans<<"\n";
    cout<<mxid<<' ';
    for(int i=n-1;i>=0;i--){
        if(a[i].id==mxid) continue;
        cout<<a[i].id<<' ';
    }
    cout<<"\n";
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}

/*
 2
 4 2
 3 6
 1 3
 2 7
 5 6
 2 5
 2 4
 6 8

*/