#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000013;
const int P=998244353;
int le[N],ri[N];
void solve(){
    map<pair<int,int>,int>mp;
    ll ans=0;
    int n;
    int p;
    cin>>n>>p;
    for(int i=1,x,y;i<=n;i++)cin>>x>>y,ans+=y-x,mp[{x,i}]=y,le[i]=x,ri[i]=y;
    vector<int>sx,tmp;
    while(!mp.empty()){
        auto[pr,r]=*mp.begin();
        if(pr.first>p) {
            ans+=pr.first-p,p+=pr.first;
            continue;
        }
        int high=0,R=p;
        while(!mp.empty()&&mp.begin()->first.first<=p) {
            auto[pr2,rr]=*mp.begin();
            if(rr>R){if(high)tmp.push_back(high);R=rr,high=pr2.second;}
            else tmp.push_back(pr2.second);
            mp.erase(mp.begin());
        }
        p=R;
        if(high)sx.push_back(high);
    }
    sort(tmp.begin(), tmp.end(),[&](int x,int y){return le[x]>le[y];});
    for(auto x:tmp)sx.push_back(x);
    cout<<ans<<'\n';
    for(auto x:sx)cout<<x<<' ';cout<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    int T=1;
    cin>>T;
    while(T--)solve();
}