#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
struct Man {
    int st;
    int ed;
    int tag;
    bool operator < (const Man b) const {
        return ed < b.ed;
    }
    Man(int x , int y , int z) {
        st = x;
        ed = y;
        tag = z;
    }
};
bool cmp(Man x , Man y) {
    return x.st < y.st;
}
signed main() {
    int t;
    cin >> t;
    while(t --) {
        vector<Man> vec;
        int n , f;
        cin >> n >> f;
        for(int i = 0; i < n; i ++) {
            int l , r;
            cin >> l >> r;
            vec.push_back(Man(l , r , i + 1));
        }
        multiset<Man>st;
        sort(vec.begin() , vec.end() , cmp);
        int i = 0;
        int ans = 0;
        vector<int>tmp;
        auto now = Man(f , 0 , 0);
        while(i != n || !st.empty()) {
            if(i == n) {
                auto it = --st.end();
                ans += max(0 , it->st - now.st) + it->ed - it->st;
                now.st = it->ed;
                tmp.push_back(it->tag);
                st.erase(it);
            }else {
                if(vec[i].st <= now.st || (--st.end())->ed < now.st) {
                    st.insert(vec[i]);
                    i ++;
                    continue;
                }else {
                    if(st.empty()) {
                        st.insert(vec[i]);
                        i ++;
                    }
                    auto it = --st.end();
                    ans += max(0 , it->st - now.st) + it->ed - it->st;
                    now.st = it->ed;
                    tmp.push_back(it->tag);
                    st.erase(it);
                }
            }
        }
        cout << ans << endl;
        for(auto it : tmp) {
            cout << it << " ";
        }
        cout << endl;
        
    }
    return 0;
}