#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

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

int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, f;
        cin >> n >> f;
        vector<Person> people(n);
        for (int i = 0; i < n; ++i) {
            people[i].id = i + 1;
            cin >> people[i].l >> people[i].r;
        }

        sort(people.begin(), people.end(), [](const Person& a, const Person& b) {
            return a.r < b.r;
        });

        long long total_cost = 0;
        int current_floor = f;
        vector<int> order;
        for (int i = 0; i < n; ++i) {
            total_cost += max(0, people[i].l - current_floor);
            total_cost += people[i].r - people[i].l;
            current_floor = people[i].r;
            order.push_back(people[i].id);
        }

        cout << total_cost << endl;
        for (int i = 0; i < n; ++i) {
            cout << order[i] << (i == n - 1 ? "" : " ");
        }
        cout << endl;
    }
    return 0;
}