#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;



void solve() {
    int n,f;
    cin >> n >> f;
    vector<array<int,3> > segs(n);
    for(int i = 0;i < n ;i ++){
        cin >> segs[i][0] >> segs[i][1];
        segs[i][2] = i + 1; 
    }
    int nowr = f;
    ll ans = 0;
    set<pii> maxrs,minls;
    for(int i = 0;i < n;i ++){
        minls.insert({segs[i][0],segs[i][2]});
    }
    vector<int> ansp;
    while(minls.size()){
        while(minls.size() && (*minls.begin()).first <= nowr){
            int num = (*minls.begin()).second;
            // cout << num << ' ' << (*minls.begin()).first << ' ' << nowr << '\n';
            maxrs.insert({segs[num - 1][1],num});
            minls.erase(minls.begin());
        }
        if(maxrs.size()){
            auto it = maxrs.end();
            it --;
            if(nowr < it->first){
                ans += (it->first) - nowr; 
                nowr = it->first;
                ansp.push_back(it->second);
                maxrs.erase(it);
            }
        }
        if(minls.size()){
            if(nowr < (minls.begin())->first){
                int num = (*minls.begin()).second;
                ansp.push_back(num);
                ans += segs[num - 1][1] - nowr;
                nowr = segs[num - 1][1];
                minls.erase(minls.begin());
            }
        }
    }
    while(maxrs.size()){
        auto it = maxrs.end();
        it --;
        int num = it->second;
        ans += segs[num - 1][1] - segs[num - 1][0];
        ansp.push_back(it->second);
        maxrs.erase(it);
    }
    cout << ans << '\n';
    for(int i = 0;i < n;i ++){
        cout << ansp[i] << ' ';
    }
    cout << '\n';
}

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