#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 l < x.l;
    }
} s[100010];
struct node1{
    i64 l, r;
    int id;
    bool operator<(const node1 x) const{
        return r > x.r;
    }
} t[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;
        i64 mx = 0, idx = 0;
        for (int i = 1; i <= n;i++){
            cin >> s[i].l >> s[i].r, s[i].id = i;
            mx = max(mx, s[i].r);
        }
        sort(s + 1, s + n + 1);
        i64 sum = 0;
        vector<int> ord;
        vector<bool> vis(n + 1);
        int cur = f;
        for (int i = 1; i <= n;i++){
            if(s[i].l<=cur&&s[i].r>cur){
                idx = i;
                break;
            }
        }
        if(!idx){
            for (int i = 1; i <= n; i++)
                if (s[i].l > cur){
                    sum += s[i].l - cur;
                    idx = i;
                    break;
                }
        }
        if(!idx){ //r_max <= f
            for (int i = 1; i <= n;i++){
                if(s[i].r==mx){
                    ord.push_back(s[i].id);
                    vis[i] = 1;
                    break;
                }
            }
        }else{
            cur = s[idx].r, vis[idx] = 1;
            sum += s[idx].r - s[idx].l;
            ord.push_back(s[idx].id);
            for (int i = idx + 1; i <= n;i++){
                if (s[i].r < cur)
                    continue;
                sum += max(0LL, s[i].l - cur);
                sum += s[i].r - s[i].l;
                cur = s[i].r, vis[i] = 1;
                ord.push_back(s[i].id);
                if(cur==mx)
                    break;
            }
        }
        
        int cnt = 0;
        for (int i = 1; i <= n;i++){
            if(!vis[i]){
                sum += s[i].r - s[i].l;
                t[++cnt].l = s[i].l;
                t[cnt].r = s[i].r;
                t[cnt].id = s[i].id;
            }
        }
        sort(t + 1, t + cnt + 1);
        for (int i = 1; i <= cnt;i++)
            ord.push_back(t[i].id);
        cout << sum << endl;
        for(auto i:ord)
            cout << i << ' ';
        cout << endl;
    }
    return 0;
}