#include<bits/stdc++.h>
#define endl '\n' 
using i64 = long long;
using namespace std;
struct node{
    i64 l, r;
    int id;
    bool operator<(const node x)const{
        return r > x.r;
    }
} s[100010];
signed main(){
    std::ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int T, n;
    i64 f;
    cin >> T;
    while(T--){
        cin >> n >> f;
        for (int i = 1; i <= n;i++)
            cin >> s[i].l >> s[i].r, s[i].id = i;
        sort(s + 1, s + n + 1);
        i64 sum = max(0LL, s[1].l - f);
        for (int i = 1; i <= n;i++)
            sum += s[i].r - s[i].l;
        cout << sum << endl;
        for (int i = 1; i <= n;i++)
            cout << s[i].id << ' ';
        cout << endl;
    }
    return 0;
}