#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e5+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
/*
首先是题意理解,其用词不是exactly
其次是单调队列优化问题,队列里存储的是下标。
然后是两次反向操作,一些细节问题。
*/
int n,m,d,pre=0,tmp;
int dp[maxn],dp1[maxn],dp2[maxn],sk[maxn];///dp三个数组
ll sum=0;
void solve1(int x){
int l=1,r=0;
rep(i,1,n+1){
while(l<=r&&sk[l]+x<i) l++;
if(l>r) dp1[i]=INT32_MAX;
else dp1[i]=dp[sk[l]];///坑点
while(l<=r&&dp[sk[r]]>=dp[i]) r--;
sk[++r]=i;
}
}
void solve2(int x){
int l=1,r=0;
for(int i=n;i>=1;i--){
while(l<=r&&i+x<sk[l]) l++;
if(l>r) dp2[i]=INT32_MAX;
else dp2[i]=dp[sk[l]];
while(l<=r&&dp[sk[r]]>=dp[i]) r--;
sk[++r]=i;
}
}
int main(){
ios::sync_with_stdio(false);/*
freopen("d://in.txt","r",stdin);
freopen("d://out.txt","w",stdout);*/
cin>>n>>m>>d;
rep(i,0,m){
int a,b,t;
cin>>a>>b>>t;
sum+=b;
tmp=min(1LL*(t-pre)*d,1LL*n);
if(tmp) solve1(tmp),solve2(tmp);
rep(j,1,n+1){
if(tmp) dp[j]=min(dp[j],min(dp1[j],dp2[j]));
dp[j]+=(int)abs(j-a);
}
pre=t;
}
rep(i,2,n+1) dp[1]=min(dp[i],dp[1]);
cout<<sum-dp[1]<<"\n";
return 0;
}