#include <stdio.h>

long long v[1000000], n, a, b, c, cost, t;

int main()
{
	freopen("gardieni.in","r",stdin);
	freopen("gardieni.out","w",stdout);

	long long i, j;
	scanf("%lld %lld",&n, &t);
	for (i = 1; i <= n; i++)
	{
		scanf("%lld %lld %lld", &a, &b, &c);
		for (j = a; j <= b; j++) if (!v[j] || v[j] > c) v[j] = c;
	}

	for (i = 1; i <= t; i++) cost += v[i];
	printf("%lld\n",cost);
	return 0;
}