#include<bits/stdc++.h>

using namespace std;

#define endl "\n"
#define ll long long
#define all(x) (x).begin() ,(x).end()

void solve(){
    ll n,f;cin>>n>>f;
    vector<pair<ll,ll>> vp(n);
    for(auto &[x,y] : vp) cin>>x>>y;
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
    for(ll i = 0;i<n;i++){
        pq.push({vp[i].first , i});
    }
    ll pos = f;
    ll lj = 0;
    vector<ll> ans;
    while(pq.size()){
        auto [l , id] = pq.top();pq.pop();
        if(l >= pos){
            lj += vp[id].second - pos;
            pos = vp[id].second;
            ans.push_back(id);
        }else lj += vp[id].second - vp[id].first;
    }
    vector<ll> vis(n,0);
    for(ll x : ans) vis[x] = 1;
    vector<pair<ll,ll>> vp2;
    for(ll i =0;i<n;i+=1){
        if(vis[i]) continue;
        vp2.push_back({vp[i].second , i});
    }
    sort(all(vp2));reverse(all(vp2));
    for(auto [r,id]:vp2) ans.push_back(id);
    cout<<lj<<endl;
    for(ll x:ans) cout<<x+1<<" ";
    cout<<endl;
}

signed main(){
    cin.tie(0);cout.tie(0);
    ios::sync_with_stdio(0);
    ll t;cin>>t;while(t--)
        solve();
}