//Think twice,code once.
#include<bits/stdc++.h>
#define endl '\n'
#define int long long
#define INF 0x3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define ff first
#define ss second
#define pii pair<int,int>
#define mem(i,n) memset(i,n,sizeof i)
#define dg(a) std::cout << #a << " = " << a << endl
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

struct node
{
    int l,r,idx;
    bool operator < (const node&b) const {
        return r>b.r;
    }
};


void solve()
{
    int n,f;
    cin >> n >> f;
    vector<node>a(n+1);
    int ans=0;
    int res=INF;
    for(int i=1;i<=n;i++)
    {
        cin >> a[i].l >> a[i].r;
        a[i].idx=i;
        ans+=a[i].r-a[i].l;
    }
    sort(a.begin()+1,a.end());
    res=min(res,max(0ll,a[1].l-f));
    int pos=1;
    for(int i=2;i<=n;i++)
    {
        int t=max(0ll,a[i].l-f)+max(0ll,a[1].l-a[i].r);
        if(t<res)
        {
            res=t;
            pos=i;
        }
    }
    cout << ans+res << endl;
    cout << a[pos].idx << ' ';
    for(int i=1;i<=n;i++)
    {
        if(i==pos) continue;
        cout << a[i].idx << ' ';
    }   
    cout << endl;
}

int32_t main()
{
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int t = 1;
    std::cin >> t;
    while(t--) solve();
    return 0;
}