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

using namespace std;

struct Person {
    int id;
    int l;
    int 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;
        }

        long long min_cost = -1;
        vector<int> min_permutation;

        vector<int> permutation(n);
        for (int i = 0; i < n; ++i) {
            permutation[i] = i;
        }

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

            for (int i = 0; i < n; ++i) {
                int person_index = permutation[i];
                current_cost += max(0, people[person_index].l - current_floor);
                current_floor = people[person_index].l;
                current_cost += people[person_index].r - people[person_index].l;
                current_floor = people[person_index].r;
                current_permutation.push_back(people[person_index].id);
            }

            if (min_cost == -1 || current_cost < min_cost) {
                min_cost = current_cost;
                min_permutation = current_permutation;
            }
        } while (next_permutation(permutation.begin(), permutation.end()));

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

    return 0;
}