#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <numeric>
#include <array>
#include <tuple>
#include <cassert>
#include <random>
#include <chrono>
#define int long long

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using PII = std::pair<int, int>;

//std::mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};
constexpr int N = 2e5 + 10;

void solve() {
    int n, f;
    std::cin >> n >> f;

    using tii = std::tuple<int, int, int>;
    std::priority_queue<tii, std::vector<tii>, std::greater<tii>> q;
    std::vector<tii> a(n + 1);
    int res = 0;
    for (int i = 1; i <= n; i ++) {
        int l, r;
        std::cin >> l >> r;
        a[i] = {l, r, i};
        // res += r - l;
    }
    std::sort(a.begin() + 1, a.end(), [](const auto& x, const auto& y) {
        if (std::get<1>(x) == std::get<1>(y)) {
            return std::get<0>(x) < std::get<0>(y);
        }
        return std::get<1>(x) > std::get<1>(y);
    });

    for (int i = 1; i <= n; i ++) {
        auto [l, r, id] = a[i];
        q.push({l, r, i});
    }

    std::vector<int> ans;
    std::vector<bool> st(n + 1);
    int pos = n;
    for (int op = 1; op <= n; op ++) {
        auto curp = std::lower_bound(a.begin() + 1, a.begin() + pos + 1, tii(f, 2e9, 2e9), std::greater<tii>()) - a.begin();
        // std::cout << "??-> " << curp << "\n";
        if (curp > pos || get<1>(a[curp]) < f) {
            while (!q.empty()) {
                auto [l, r, i] = q.top();
                if (i > pos || r < f) {
                    q.pop();
                } else {
                    break;
                }
            }
            if (q.empty()) {
                break;
            }
            auto [_1, _2, id] = q.top();
            auto [l, r, ri] = a[id]; 
            q.pop();
            res += std::max(0ll, l - f);
            f = r;
            res += r - l;
            pos = id - 1;
            ans.push_back(ri);
            st[id] = true;
            if (pos == 0) {
                break;
            }
        } else {
            pos = curp - 1;
            res += get<1>(a[curp]) - get<0>(a[curp]);
            f = get<1>(a[curp]);
            ans.push_back(get<2>(a[curp]));
            st[curp] = true;
            if (pos == 0) {
                break;
            }
        }
    }

    for (int i = 1; i <= n; i ++) {
        if (!st[i]) {
            res += std::get<1>(a[i]) - std::get<0>(a[i]);
            ans.push_back(get<2>(a[i]));
        }
    }
    std::cout << res << "\n";
    for (auto x : ans) {
        std::cout << x << " ";
    }
    std::cout << "\n";
    return;
}
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int T = 1;
    std::cin >> T;
    while (T --) {
        solve();
    }
    return 0;
}