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

struct node
{
    int l,r;
    int id;
};


void work()
{
    int n,f, mxr = 0;
    std::cin>>n>>f;
    std::vector<node > a(n+1);
    vector<bool> vis(n + 1); 
    ll ans=0;
    vector<int> Rg;
    vector<int> jump;
    Rg.push_back(f);
    for(int i=1;i<=n;i++)
    {
        int x,y;
        std::cin>>x>>y;
        ans += 1ll * y - x;
        a[i]={x,y,i};
        Rg.push_back(x);
        Rg.push_back(y);
    }
    sort(Rg.begin(), Rg.end());
    Rg.erase(unique(Rg.begin(), Rg.end()), Rg.end());
    int N = Rg.size();
    vector<int> di(N + 1);
    vector<int> nex (N + 1);
    f = lower_bound(Rg.begin(), Rg.end(), f) - Rg.begin() + 1;
    //cout << f<< " ";
    for(int i=1;i<=n;i++)
    {
        a[i].l = lower_bound(Rg.begin(), Rg.end(), a[i].l) - Rg.begin() + 1;
        a[i].r = lower_bound(Rg.begin(), Rg.end(), a[i].r) - Rg.begin() + 1;
        //cout << a[i].l <<" " << a[i].r<<"\n";
        if(a[i].r >= a[di[a[i].l]].r) di[a[i].l] = i;
        mxr = max(mxr, a[i].r);
    }
    int nexid = 0;
    for(int i = N; i >= 1; i--){
        if(di[i]) nexid = di[i];
        nex[i] = nexid;
        //cout << i<<":" <<di[i] <<" " <<nex[i]<<"\n";
    }
    vector<int> mx(4 * N + 1);
    auto build =[&] (auto self, int k, int l, int r) -> void{
        if(l == r){
            mx[k] = di[l];
            return;
        }
        int mid = l + r >> 1;
        self(self, k << 1, l, mid);
        self(self, k << 1 | 1, mid + 1, r);
        //cout << k <<" " << l <<" " << r << " " << a[mx[k << 1]].r <<" " << a[mx[k << 1 | 1]].r << "\n"; 
        if(a[mx[k << 1]].r >= a[mx[k << 1 | 1]].r) mx[k] = mx[k << 1];
        else mx[k] = mx[k << 1 | 1];
    };
    auto query =[&] (auto self, int k, int l, int r, int x, int y) -> int{
        //if(!k) return 0;
        //if(k > 4 * N) return 0;
        if(x <= l && r <= y) return mx[k];
        int mid = l + r >> 1;
        if(y <= mid) return self(self, k << 1, l, mid, x, y);
        else if(x > mid) return self(self, k << 1 | 1, mid + 1, r, x, y);
        else{
            int lc = self(self, k << 1, l, mid, x, y);
            int rc = self(self, k << 1 | 1, mid + 1, r, x, y);
            if(a[lc].r >= a[rc].r) return lc;
            else return rc;
        }
    };
    build(build, 1, 1, N);
    int pref = 0;
    while(f < mxr){
        int i = query(query, 1, 1, N, pref + 1, f);
        if(a[i].r <= f){
            i = nex[f];
            ans += 1ll * a[i].l - f;
        }
        pref = f;
        f = a[i].r;
        //cout <<pref<<" "<< f <<" " << i <<" " << mxr<<"\n";
        vis[i] = 1;
        jump.push_back(i);
    }
    auto cmp=[](node x,node y) ->bool
    {
        return x.l>y.l;
    };
    std::sort(a.begin()+1,a.end(),cmp);

    std::cout<<ans<<'\n';
    //reverse(jump.begin(), jump.end());
    for(auto i:jump) cout << i<<" ";

    for(int i=1;i<=n;i++)
        if(!vis[a[i].id]) std::cout<<a[i].id<<' ';
    std::cout<<'\n';
}

int main()
{
    std::cin.tie(0);
    std::cin.sync_with_stdio(0);
    int t=1;
    std::cin>>t;
    while(t--)
        work();
    return 0;
}
/*
3
4 2
3 6
1 3
2 7
5 6
2 5
2 4
6 8
4 3
4 6
7 8
2 5
1 3
*/