//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) greverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n;
int l[500500],r[500500];
ll w[500500];
ll dp[500500];
int lst[500500];
int choose[500500];
ll dist[500500];
int inque[500500];
vector<pair<int,ll>> G[500500];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int k;
	cin>>n>>n>>k;
	for(int i=1;i<=n;i++)
		cin>>l[i]>>r[i]>>w[i];
	vector<pii> vec;
	for(int i=1;i<=n;i++)
		vec.pb(l[i],i);
	srt(vec);
	int p=0;
	memset(dp,-inf,sizeof(dp));
	dp[0]=0;
	for(int i=0;i<=500000;i++)
	{
		if(dp[i]>dp[i+1])
		{
			dp[i+1]=dp[i];
			lst[i+1]=-1;
		}
		while(p<sz(vec)&&vec[p].first==i+1)
		{
			if(dp[i]+w[vec[p].second]>dp[r[vec[p].second]])
			{
				dp[r[vec[p].second]]=dp[i]+w[vec[p].second];
				lst[r[vec[p].second]]=vec[p].second;
			}
			p++;
		}
	}
	ll ans=dp[500000];
	int cur=500000;
	while(cur)
	{
		if(lst[cur]==-1)
		{
			G[cur].pb(cur-1,0);
			cur--;
		}
		else
		{
			choose[lst[cur]]=1;
			cur=l[lst[cur]]-1;
		}
	}
	for(int i=2;i<=k;i++)
	{
		memset(dist,-inf,sizeof(dist));
		priority_queue<pair<ll,int>> pq;
		pq.emplace(0,0);
		dist[0]=0;
		for(int i=1;i<=500000;i++)
			G[i-1].pb(i,0);
		for(int i=1;i<=n;i++)
			if(!choose[i])
				G[l[i]-1].pb(r[i],i);
			else
				G[r[i]].pb(l[i]-1,i);
		while(!pq.empty())
		{
			ll d=pq.top().first;
			int x=pq.top().second;
			pq.pop();
			if(dist[x]!=d) continue;
			for(auto pr:G[x])
			{
				ll edge;
				if(!pr.second) edge=0;
				else if(choose[pr.second]) edge=-w[pr.second];
				else edge=w[pr.second];
				ll nd=edge+dp[x]-dp[pr.first]+dist[x];
				if(nd>dist[pr.first])
				{
					lst[pr.first]=pr.second;
					dist[pr.first]=nd;
					pq.emplace(nd,pr.first);
				}
			}
		}
		for(int i=0;i<=500000;i++)
			G[i].clear();
		int nd=500000;
		while(nd)
		{
			int val=lst[nd];
			if(val)
			{
				nd=l[val]+r[val]-1-nd;
				choose[val]^=1;
			}
			else
				nd--;
		}
		for(int i=0;i<=500000;i++)
			dp[i]=max(dp[i]+dist[i],-1ll*inf*inf);
		ans+=dp[500000]-dp[0]+dist[500000];
	}
	cout<<ans<<endl;
	return 0;
}