#include <bits/stdc++.h>
#define int long long
#define lson k<<1
#define rson (k<<1)|1
#define debug cout<<666<<endl;
using namespace std;
const int N=1e6+5;
void vision()
{
    int n,now;
    cin>>n>>now;
    int st=now;
    map<pair<int,int>,vector<int>>mp;

    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q1;//fir xiao dao da
    priority_queue<pair<int,int>,vector<pair<int,int>>>q2;
    int ans=0;
    for(int i=1;i<=n;i++){
        int x,y;
        cin>>x>>y;
        mp[{x,y}].push_back(i);
        if(x<=now)q2.push({y,x});
        else q1.push({x,y});
    }
    vector<int>vv;
    vector<int>v;
    int p=0;
    while(q1.size()||q2.size()){
        pair<int,int>t;
        if(q2.size()!=0){
            t=q2.top();
            q2.pop();
        }
        else {
            t=q1.top();
            q1.pop();
        }
        ans=ans+abs(t.first-t.second);
        pair<int,int>tt={min(t.first,t.second),max(t.first,t.second)};
        // int w=mp[t][(int)mp[t].size()-1];
        // mp[t].pop_back();
        int w=*(--mp[tt].end());
        mp[tt].pop_back();
        if(now<min(t.first,t.second)){
            if(p==0){
                if(now<st){
                    p=1;
                    ans=ans+min(t.first,t.second)-st;
                }
            }
            else {
                ans=ans+min(t.first,t.second)-now;
            }
        }
        if(p==1)vv.push_back(w);
        else v.push_back(w);
        now=max(t.first,t.second);
        while(q1.size()){
            if(q1.top().first<=now){
                q2.push(q1.top());
                q1.pop();
            }
            else break;
        }
    }

    cout<<ans<<"\n";
    for(auto it:vv)cout<<it<<" ";
    for(auto it:v)cout<<it<<" ";
    cout<<"\n";
    return ;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t=1;
    cin>>t;
    while(t--){
        vision();
    }
    return 0;
}