#include<bits/stdc++.h>
using namespace std;
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define int long long 
#define pre(i,a,b) for(int i=a;i<=b;i++)
const int N = 1e6 + 10;
struct node 
{
    int l,r,id;
    bool operator<(const node &w) const 
    {
        if(r != w.r) return r > w.r; // r min
        return l > w.l; // l min
    }
}a[N];
int n,f;
bool cmp(node a,node b)
{
    if(a.l != b.l)
        return a.l > b.l;
    return a.r < b.r;
}
void solve()
{
    cin >> n >> f;
    int ans = 0;
    pre(i,1,n) 
    {
        cin >> a[i].l >> a[i].r;
        a[i].id = i;
    }
    sort(a + 1,a + 1 + n,cmp);
    vector<int> tmp;
    priority_queue<node> q;
    pre(i,1,n)
    {
        if(a[i].r <= f)
        {
            ans += a[i].r - a[i].l;
            tmp.push_back(a[i].id);
        }
        else 
        {
            q.push(a[i]);
        }
    }
    vector<int> ve;
    while(!q.empty())
    {
        auto [x,y,id] = q.top();
        q.pop();
        if(x <= f)
        {
            ans += y - x;
            f = y;
        }
        else 
        {
            ans += y - f;
            f = y;
        }
        ve.push_back(id);
    }
    cout << ans << endl;
    for(auto L : ve)
         cout << L << " ";
    for(auto L : tmp)
        cout << L << " ";
    cout << endl;
    return ;
    pre(i,1,n)
    {
        ans += max(a[i].l - f,0ll) + a[i].r - a[i].l;
        f = a[i].r;
        // cout << i << " " << ans << endl;
    }
    cout << ans << endl;
    cout << endl;

}
signed main()
{
    _;
    int t = 1;
    cin >> t;
    while(t --)
        solve();
}