#include<iostream>
#include<cstring>
#include<vector>
#include<numeric>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n, f;
        cin >> n >> f;
        vector<pair<int, int> > p(n);
        LL sum = 0;
        for(int i = 0; i < n; i++){
            int l, r;
            cin >> l >> r;
            sum += r - l;
            p[i] = {l, r};
        }
        vector<int> id(n);
        iota(id.begin(), id.end(), 0);
        sort(id.begin(), id.end(), [&](int a, int b){
            return p[a] < p[b];
        });
        vector<int> q, ans;
        int R = f;
        for(auto x : id){
            auto [l, r] = p[x];
            if (r <= R){
                q.push_back(x);
                continue;
            }
            ans.push_back(x);
            R = r;
            sum += max(0, l - R);
        }
        cout << sum << '\n';
        sort(q.begin(), q.end(), [&](int a, int b){
            return p[a].second > p[b].second;
        });
        for(auto x : q) ans.push_back(x);
        for(auto x : ans) cout << x + 1 << ' ';
        cout << '\n';
    }

}