#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Person {
    int id;
    int l;
    int r;
};

bool compare(const Person &a, const Person &b) {
    if (a.r == b.r) {
        return a.l > b.l; // 如果r相同，按l降序排列
    }
    return a.r > b.r; // 按r降序排列
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int T;
    cin >> T;
    while (T--) {
        int n, f;
        cin >> n >> f;
        vector<Person> people(n);
        for (int i = 0; i < n; ++i) {
            cin >> people[i].l >> people[i].r;
            people[i].id = i + 1;
        }
        
        // 按r降序排序
        sort(people.begin(), people.end(), compare);
        
        long long total = 0;
        int current = f;
        vector<int> order;
        for (auto &p : people) {
            int cost = max(p.l - current, 0);
            total += cost;
            total += (p.r - p.l);
            current = p.r;
            order.push_back(p.id);
        }
        
        cout << total << "\n";
        for (int i = 0; i < n; ++i) {
            cout << order[i] << (i == n - 1 ? "\n" : " ");
        }
    }
    
    return 0;
}