#include <bits/stdc++.h>
#define NMAX 50005
using namespace std;
ifstream fin("gardieni.in");
ofstream fout("gardieni.out");

long long n,t,ind,rasp,cnt;
bool verif[1000005];

struct elem
{
    int x,y,cost;
};
elem v[NMAX];
bool cmp(elem a,elem b)
{
    return a.cost<b.cost;
}
int main()
{
    fin>>n>>t;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i].x>>v[i].y>>v[i].cost;
    }
    sort(v+1,v+n+1,cmp);
    while(cnt<t)
    {
        ind++;
        for(int i=v[ind].x;i<=v[ind].y;i++)
        {
            if(!verif[i])
            {
                verif[i]=1;
                rasp+=v[ind].cost;
                cnt++;
            }
        }
    }
    fout<<rasp;
}