#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
    int n, e, u;
    cin >> n >> e >> u;
    vector<int> dp(u+1, 1e16), ut(u+1);
    vector<pair<int, int>> v(n+1);
    //map<int, vector<pair<int, int>>> vp;
    vector<pair<int, pair<int, int>>> vp;
    for (int i = 1; i <= n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        if (b<e||a>u)continue;
        a=max(a,e);
        b=min(b,u);
        //vp[a].push_back({i, c});
        vp.push_back({a, {i, c}});
        v[i] = {a, b};
    }
    sort(vp.begin(), vp.end());
    int cnt = 0;
    dp[e-1]=0;
    priority_queue<pair<int, int>> q;
    for (int i = e; i <= u; i++) {
        // for (auto [a, b] : vp[i]) {
        //     q.push({-(dp[i-1]+b), a});
        // }
        while (cnt<vp.size()&&vp[cnt].first==i) {
            q.push({-(dp[i-1]+vp[cnt].second.second), vp[cnt].second.first});
            cnt++;
        }
        while (!q.empty()&&v[q.top().second].second<i)q.pop();
        if (!q.empty()) {
            dp[i]=-q.top().first;
            ut[i]=q.top().second;
        }
    }
    if (dp[u]>=1e15) {
        cout << -1;
        return 0;
    }
    vector<int> ansv;
    int x = ut[u];
    while (x!=0) {
        ansv.push_back(x);
        x=ut[v[x].first-1];
    }
    sort(ansv.begin(), ansv.end());
    cout << dp[u] << '\n';
    cout << ansv.size() << ' ';
    for (int y : ansv) cout << y << ' ';
}