#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::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);
    });

    std::priority_queue<tii, std::vector<tii>, std::greater<tii>> q;

    std::vector<int> ans;
    std::vector<bool> st(n + 1);
    
    for (int i = 1; i <= n; i ++) {
        auto [l, r, id] = a[i];

        if (l <= f && f < r) {
            f = r;
            ans.push_back(id);
            st[i] = 1;
            break;
        } else if (l <= f && f >= r) {
            break;
        } else {
            q.push({l, r, i});
        }
    }

    while (!q.empty()) {
        auto [l, r, i] = q.top();
        int id = get<2>(a[i]);
        q.pop();

        if (l <= f) {
            f = r;
            ans.push_back(id);
            st[i] = 1;
        } else {
            res += l - f;
            f = r;
            ans.push_back(id);
            st[i] = 1;
        }
    }
    for (int i = 1; i <= n; i ++) {
        if (!st[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;
}