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

using namespace std;

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

bool comparePeople(const Person& a, const Person& b) {
    if (a.l != b.l) {
        return a.l < b.l;
    }
    return a.r < b.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(), comparePeople);

        long long current_cost = 0;
        int current_floor = f;
        vector<int> current_permutation;

        for (int i = 0; i < n; ++i) {
            current_cost += max(0, people[i].l - current_floor);
            current_floor = people[i].l;
            current_cost += people[i].r - people[i].l;
            current_floor = people[i].r;
            current_permutation.push_back(people[i].id);
        }
        
        cout << current_cost << endl;
        for (int i = 0; i < n; ++i) {
            cout << current_permutation[i] << (i == n - 1 ? "" : " ");
        }
        cout << endl;
    }

    return 0;
}