#include <bits/stdc++.h>
using i64 = long long;
#define int i64
#define pb push_back
#define ep emplace
#define eb emplace_back
using std::cerr;
// using namespace std::views;
// using namespace std::ranges;
using std::max, std::min, std::swap, std::array;
using std::cin, std::cout, std::string, std::vector;
using std::ostream;
int read(int x = 0, int f = 0, char ch = getchar()) {
    while (ch < 48 or 57 < ch) f = ch == 45, ch = getchar();
    while(48 <= ch and ch <= 57) x = x * 10 + ch - 48, ch = getchar();
    return f ? -x : x;
}
template <class T1, class T2> ostream &operator<<(ostream &os, const std::pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << '\n'; }
using pii = std::pair<int, int>;
#define fi first
#define se second

void solve() {
    int n = read(), f = read();
    vector<pii> a(n + 1);
    a[0] = {0, f};
    for (int i = 1; i <= n; i++) {
        a[i].fi = read();
        a[i].se = read();
    }

    std::vector<int> p(n + 1);
    std::iota(p.begin(), p.end(), 0);

    std::sort(p.begin() + 1, p.end(), [&](int x, int y) {
        if (a[x].se == a[y].se) return a[x].fi > a[y].fi;
        return a[x].se > a[y].se;
    });

    int ans = 0;
    for (int i = 1; i <= n; i++) {
        int j = p[i];
        ans += a[j].se - a[j].fi;
        ans += max(0LL, a[j].fi - a[p[i - 1]].se);
    }
    cout << ans << '\n';
    for (int i = 1; i <= n; i++) {
        cout << p[i] << " \n"[i == n];
    }
}

signed main() {
    for (int T = read(); T--; solve());
    // solve();
    return 0;
}