#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 30;

int p[N];
void init()
{
    for(int i = 0;i<=N;i++)
    {
        p[i] = i;
    }
    
}
int find(int x)  // 并查集
{
    if (p[x] != x) p[x] = find(p[x]);
    return p[x];
}
void merge(int x,int y)
{
    x = find(x),y = find(y);
    if(x!=y)
    {
        p[x] = p[y];
    }
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        init();
        ll n, m;
        cin >> n >> m;
        vector<array<int,3>> poi(n);
        for(int i = 0; i < n ; i++){
            cin >> poi[i][0]>>poi[i][1];
            poi[i][2] = i+1;
        }
        sort(poi.begin(),poi.end());
        
        for(int i = 1;i<n;i++)
        {
            if(poi[i][0]<=poi[i-1][1])
            {
                merge(poi[i][2],poi[i-1][2]);
            }
        }
        int index = n;
        for(int i = 0;i<n;i++)
        {
            if(poi[i][0]>=m)
            {
                index = i;
                break;
            }
        }
        ll ans = 0;
        vector<int>inx;
        map<int,int>mp;
        ll now = m;
        if(index!=n)
        {
            for(int i = index;i<n;i++)
            {
                if(mp[find(i)]==0)
                {
                    mp[find(i)] = 1;
                    ans+=poi[i][0]-now;
                    ans+=poi[i][1]-poi[i][0];
                    inx.push_back(poi[i][2]);
                }
                else{
                    ans+=poi[i][1]-poi[i][0];
                    inx.push_back(poi[i][2]);
                }
            }
        }
        
        for(int i = index-1;i>=0;i--)
        {
            ans+=poi[i][1]-poi[i][0];
            inx.push_back(poi[i][2]);
        }
        cout<<ans<<endl;
        for(int i = 0;i<inx.size();i++)
        {
            cout<<inx[i]<<" ";
        }
        cout<<endl;
        
    }
}