#include <fstream>

using namespace std;

ifstream in ("gardieni.in");
ofstream out ("gardieni.out");

const long long max_size = 1e6 + 1, INF = (1 << 20) + 1;

long long ans[max_size];

int main ()
{
    long long m, n;
    in >> m >> n;
    for (long long i = 1; i <= n; i++)
    {
        ans[i] = INF;
    }
    while (m--)
    {
        long long x, y, c;
        in >> x >> y >> c;
        for (long long i = x; i <= y; i++)
        {
            ans[i] = min(ans[i], c);
        }
    }
    long long rez = 0;
    for (long long i = 1; i <= n; i++)
    {
        rez += ans[i];
    }
    out << rez;
    in.close();
    out.close();
    return 0;
}