#include<random>
#include<iostream>
#include<iomanip>
#include<ctime>
#include<cmath>
#include<cctype>
#include<cstdio>
#include<cstdlib>
#include<climits>
// #define NDEBUG
#include<cassert>
#include<cstring>
#include<complex>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<bitset>
// #define LL __int128
#define LL long long
#define ULL unsigned LL
#define uint unsigned int
// #define int LL
// #define double long double
#define mkp make_pair
#define par pair<int,int>
#define epb emplace_back
#define psb push_back
#define f(x) ((x).first)
#define s(x) ((x).second)
using namespace std;
#define Lbt(x) ((x)&(-(x)))
#define Swap(x,y) (x^=y^=x^=y)
const int Mxxx=1e5;
inline char gc()
{
    // return getchar();
    static char buf[Mxxx],*p1=buf,*p2=buf;
    return (p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxxx,stdin),p1==p2))?EOF:*p1++;
}
inline char pc(char ch,bool fl=false)
{
    // return fl?0:putchar(ch),0;
    static char buf[Mxxx],*p1=buf,*p2=buf+Mxxx;
    return (fl||((*p1++=ch)&&p1==p2))&&(fwrite(buf,1,p1-buf,stdout),p1=buf),0;
}
#define output pc('!',true)
inline int read()
{
    char ch=gc();
    int gans=0,gflag=0;
    for(;ch<'0'||'9'<ch;ch=gc())gflag|=(ch=='-');
    for(;'0'<=ch&&ch<='9';ch=gc())gans=(gans<<1)+(gans<<3)+(ch^48);
    return gflag?-gans:gans;
}
template<typename T>
inline char read(T&gans)
{
    char ch=gc();
    int gflag=0;gans=0;
    for(;ch<'0'||'9'<ch;ch=gc())gflag|=(ch=='-');
    for(;'0'<=ch&&ch<='9';ch=gc())gans=(gans<<1)+(gans<<3)+(ch^48);
    return gans=gflag?-gans:gans,ch;
}
template<typename T>
inline void write(T x)
{
    if(x>9)write(x/10);
    pc(x%10^48);
}
template<typename T>
inline void writenum(T x,char ch)
{
    if(x<0)pc('-'),x=-x;
    write(x),pc(ch);
}
inline void writechar(char x,char ch)
{
    pc(x),pc(ch);
}
template<typename T>
inline T Max(T x,T y)
{
    return x>y?x:y;
}
template<typename T>
inline T Min(T x,T y)
{
    return x<y?x:y;
}
template<typename T>
inline T Abs(T x)
{
    return x<0?-x:x;
}
template<typename T>
inline void ckmx(T&x,T y)
{
    x=Max(x,y);
}
template<typename T>
inline void ckmn(T&x,T y)
{
    x=Min(x,y);
}
const int Mx=3e5;
int TT,n,st;LL ans;
int ps[Mx+5],psl[Mx+5],psr[Mx+5];
int top,stk[Mx+5],vst[Mx+5];
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("_.in","r",stdin);
    // freopen("_.out","w",stdout);
    #endif
    int i,p;
    for(TT=read();TT;TT--)
    {
        n=read();st=read();top=ans=0;for(i=1;i<=n;i++)vst[i]=0;
        for(i=1;i<=n;i++)ps[i]=i,psl[i]=read(),psr[i]=read(),ans+=psr[i]-psl[i];
        sort(ps+1,ps+1+n,[](int x,int y){return psl[x]<psl[y];});
        for(i=1;i<=n;i++)
        {
            p=ps[i];
            if(psl[p]<=st)
            {
                if(st<psr[p])stk[++top]=p,vst[p]=1,st=psr[p];
            }
            else ans+=psl[p]-st,st=psr[p],stk[++top]=p,vst[p]=1;
        }
        sort(ps+1,ps+1+n,[](int x,int y){return psr[x]>psr[y];});
        for(i=1;i<=n;i++)if(!vst[p=ps[i]])stk[++top]=p;
        writenum(ans,10);assert(top==n);
        for(i=1;i<=top;i++)writenum(stk[i],i==top?10:32);
    }
    return output;
}
/*
2
 4 2
 3 6
 1 3
 2 7
 5 6
 2 5
 2 4
 6 8
*/