#include <bits/stdc++.h>
#define int long long

using namespace std;

struct Node{
    int l,r,pos;
    bool operator < (const Node &other) const{
        return r<other.r;
    }
};

void solve()
{
    int n,f;
    cin>>n>>f;
    multiset<Node>se;
    for(int i=1;i<=n;i++){
        int l,r;
        cin>>l>>r;
        se.insert({l,r,i});
    }

    vector<int>ans;
    int tot=0;
    while(ans.size()!=n){
        auto t=se.lower_bound({0,f,0});
        if(t==se.end()){
            --t;
            f=(*t).r;
            continue;
        }else{
            auto [l,r,pos]=(*se.rbegin());
            tot+=max(0LL,max(r-f,r-l));
            ans.push_back(pos);
            se.erase(--se.end());
            f=r;
        }
    }

    cout<<tot<<'\n';
    for(auto x:ans){
        cout<<x<<' ';
    }
    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;
}