#include<bits/stdc++.h>
#define ll __int128
#define PII pair<int,int>
#define endl '\n'
#define int long long
#define  lc p<<1
#define  rc p<<1|1
using namespace  std;
const int N=1e6+10;
bool cmp(array<int,3>x,array<int,3>y){
    return x[0]<y[0];
}
bool cmp1(array<int,3>x,array<int,3>y){
    return x[1]>y[1];
}
void solve() {
    int n,f;
    cin>>n>>f;
    vector<array<int,3>>a,b;
    priority_queue<array<int,3>>pp;
    for (int i = 1; i <=n ; ++i) {
        int x,y;
        cin>>x>>y;
        if(x>=f)a.push_back({x,y,i});
        else pp.push({y,x,i});
    }
    sort(a.begin(), a.end(),cmp);
    std::reverse(a.begin(), a.end());
    int dq=f;
    int ans=0;
    int mt=-1;
    vector<int>p;
    while(pp.size() and pp.top()[0]>dq){
        mt=pp.top()[2];
        ans+=pp.top()[0]-pp.top()[1];
        dq=pp.top()[0];
        pp.pop();
        p.push_back(mt);
        while (a.size() and a.back()[0]<dq){
            auto [x,y,z]=a.back();
            pp.push({y,x,z});
            a.pop_back();
        }
    }
    while(pp.size()){
        auto [x,y,z]=pp.top();
        b.push_back({y,x,z});
        pp.pop();
    }
    sort(a.begin(), a.end(),cmp1);
    vector<int>mn;
    int mi=0;
    for (int i = 0; i <a.size() ; ++i) {
        if(a[mi][0]>a[i][0])mi=i;
        mn.push_back(mi);
    }
    int pos=(int)a.size()-1;
    vector<int>cnt(n+1);
    while(pos>=0){
        while (pos>=0 and a[pos][0]<=dq){
            ans+=a[pos][1]-a[pos][0];
            p.push_back(a[pos][2]);
            cnt[pos]=1;
            dq=a[pos][1];
            pos--;
        }
        if(pos<0)break;
        ans+=max(a[mn[pos]][1]-dq,0ll);
        dq=a[mn[pos]][1];
        cnt[mn[pos]]=1;
        p.push_back(a[mn[pos]][2]);
        pos=mn[pos]-1;
    }
    for (int i = 0; i <a.size() ; ++i) {
        if(!cnt[i]){
            b.push_back(a[i]);
        }
    }
    sort(b.begin(), b.end(),cmp);
    reverse(b.begin(), b.end());
    for(auto [l,r,idx]:b){
        p.push_back(idx),ans+=r-l;
    }
    cout<<ans<<endl;
    for(auto i:p){
        cout<<i<<' ';
    }
    cout<<endl;








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