#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#define int long long
using namespace std;
typedef long long ll;
const int MX=300020;

int T, N, M;    
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct seg
{
    int l, r, len, id;
}ar[MX], br[MX];
int c1=0, c2=0;
bool cmp(seg a, seg b)
{
    return a.l==b.l?a.r<b.r:a.l<b.l;
}
bool cmp2(seg a, seg b)
{
    return a.r>b.r;
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read(); M=read();
        c1=c2=0;
        int ans=0;
        for(int i=1;i<=N;i++)
        {
            int l=read(), r=read();
            if(l>=M) ar[++c1]={l,r,r-l,i};
            else br[++c2]={l,r,r-l,i}, ans+=r-l;
        }
        sort(ar+1,ar+1+c1,cmp);
        sort(br+1,br+1+c2,cmp2);
        int now=M;
        for(int i=1;i<=c1;i++)
        {
            auto [l,r,len,id]=ar[i];
            ans+=max(l-now,ll(0))+len;
            now=r;
        }
        cout << ans << '\n';
        for(int i=1;i<=c1;i++) cout << ar[i].id << " ";
        for(int i=1;i<=c2;i++) cout << br[i].id << " ";
        cout << '\n';
    }
    return (0-0);
}