#include<bits/stdc++.h>
using namespace std;

#define int long long
const int mod = 1e9 + 7;
const int N = 100005;
const int P = 131;
typedef pair<int, int> PII;

//int dx[] = {-1, 0, 1, 0};
//int dy[] = {0, 1, 0, -1};

int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

int ksm(int a, int b)
{
    int res = 1;
    while(b)
    {
        if(b & 1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

inline int read()
{
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
    {
        if(ch=='-')
            f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
        x=x*10+ch-'0',ch=getchar();
    return x*f;
}

inline void writeS(std::string s){
    int len=s.length();
    for(int i=0;i<len;i++)
        putchar(s[i]);
}

const double pi = acos(-1.0);
const double eps = 1e-8;
const double INF = 1e20;

//判断浮点数大小
int sgn(double x) {
    if(fabs(x) < eps) return 0;
    else return x < 0 ? -1 : 1;
}
// 比较浮点数
int dcmp(double x, double y) {
    if(fabs(x - y) < eps) return 0;
    else return x < y ? -1 : 1;
}
struct node
{
    int idx, l, r;
};
void solve()
{
    int n, f;
    cin >> n >> f;
    vector<int> a;
    vector<node> b(n + 1);
    int ans = 0;
    for(int i = 1; i <= n; i ++)
    {
        int l, r;
        cin >> l >> r;
        b[i] = {i, l, r};
        ans += (r - l);
    }
    auto cmp = [&](node x, node y)
    {
        if(x.l == y.l) return x.r > y. r;
        else return x.l < y.l;
    };
    vector<int> st(n + 1);
    sort(b.begin() + 1, b.end(), cmp);

    int ib = 1;
    while(ib <= n)
    {
        int mx = 0;
        int pos;
        while(ib <= n && b[ib].l < f)
        {
            mx = max(mx, b[ib].r);
            if(mx == b[ib].r) pos = ib;
            ib ++;
        }
        if(ib > n)
        {
            continue;
        }
        if(mx < f)
        {
            ans += (b[ib].l - f);
            st[b[ib].idx] = 1;
            a.push_back(b[ib].idx);
            f = b[ib].r;
            ib ++;
        }
        else
        {
            f = b[pos].r;
            a.push_back(b[pos].idx);
            st[b[pos].idx] = 1;
            ib ++;
        }
    }

    auto cmp1 = [&](node x, node y)
    {
        return x.r > y.r;
    };
    sort(b.begin() + 1, b.end(), cmp1);
    for(int i = 1; i <= n; i ++)
    {
        if(st[b[i].idx]) continue;
        a.push_back(b[i].idx);
    }
    cout << ans << endl;
    for(auto k : a) cout << k << " ";
    cout << endl;
}

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int T = 1;

    cin >> T;

    while(T--)
    {
        solve();
    }
    return 0;
}


/*
2
4 2
3 6
1 3
2 7
5 6
2 5
2 4
6 8

1
19 52
51 98
2 83
40 58
96 99
39 55
72 94
15 17
4 15
48 99
2 99
77 78
35 77
44 62
79 81
30 31
1 48
48 76
68 99
60 66
 */