#include <bits/stdc++.h>
using ll=long long;
using namespace std;
struct mor{
    ll ar;
    ll k;
    ll v;
    ll i;
};
struct p{
    ll penz;
    ll v;
    vector<ll>mego;
};
struct compar{
    bool operator()(mor a, mor b){
        return (a.ar>b.ar);
    }
};
int main()
{
    ll n,k,v;
    cin>>n>>k>>v;
    vector<vector<mor>> ve;

    ve.resize(v+1,vector<mor>());
    priority_queue<mor,vector<mor>, compar> q;
    for (ll i=0; i<n;i++){
        ll a,b,c;
        cin>>a>>b>>c;
        ve[max(a,k)].push_back({c,a,b,i});
    }
    vector<p> dp;
    dp.resize(v+1);
    dp[k-1]={0,0,{}};
    for (ll i=k;i<=v;i++){
        for (mor x:ve[i]) q.push(x);
        if (dp[i-1].v>=i) dp[i]=dp[i-1];
        else{
            while (!q.empty() && q.top().v<i){
                q.pop();

            }
            if (q.empty()){
                cout<<-1;
                return 0;
            }
            mor most=q.top();
            dp[i]=dp[most.k-1];
            dp[i].penz+=most.ar;
            dp[i].v=most.v;
            dp[i].mego.push_back(most.i);
        }
    }
    cout<<dp[v].penz<<"\n"<<dp[v].mego.size()<<" ";
    for (ll z:dp[v].mego) cout<<z+1<<" ";
}