using Lib; using System; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Runtime.CompilerServices; using System.Text; using static Lib.Functions; using static Lib.OutputLib; public class Solver { const bool MultiTestCase = false; void Solve() { int n = ri, a = ri; ReadArray(out (int x, int y, long v)[] ps, n, () => (ri, ri, rl)); Array.Sort(ps); var comp = new Compress(); foreach (var (x, y, v) in ps) comp.Add(y); comp.Build(); long Calc(int ax, int ay) { var xs = new List(); foreach (var (x, y, v) in ps) { xs.Add(x); xs.Add(x + ax); } xs.Sort(); long ans = 0; var seg = new LazySegTree(new long[comp.Count]); for (int i = 0, i1 = 0, i2 = 0; i < xs.Count; i++) { int x = xs[i]; while (i1 < n && ps[i1].x <= x) { var (_, y, v) = ps[i1++]; seg.Apply(comp.GetIndex(y), comp.LowerBound(y + ay), v); } while (i2 < n && ps[i2].x + ax <= x) { var (_, y, v) = ps[i2++]; seg.Apply(comp.GetIndex(y), comp.LowerBound(y + ay), -v); } Chmax(ref ans, seg.Prod(0, comp.Count)); } return ans; } long ans = 0; for (int f = 0; f < 4; f++) Chmax(ref ans, Calc(a + (f & 1), a + (f >> 1))); Write(ans); } struct Op : ILazySegTreeOperator { public long Identity => 0; public long Operate(long x, long y) => Math.Max(x, y); public long FIdentity => 0; public long Mapping(long f, long x) => f + x; public long Composition(long f, long g) => f + g; } #pragma warning disable CS0162, CS8618 public Solver() { if (!MultiTestCase) Solve(); else for (int t = ri; t > 0; t--) Solve(); } #pragma warning restore CS0162, CS8618 const int IINF = 1 << 30; const long INF = 1L << 60; int ri { [MethodImpl(256)] get => (int)sc.Integer(); } long rl { [MethodImpl(256)] get => sc.Integer(); } uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); } ulong rul { [MethodImpl(256)] get => sc.UInteger(); } double rd { [MethodImpl(256)] get => sc.Double(); } string rs { [MethodImpl(256)] get => sc.Scan(); } string rline { [MethodImpl(256)] get => sc.Line(); } public StreamScanner sc = new StreamScanner(Console.OpenStandardInput()); void ReadArray(out int[] a, int n) { a = new int[n]; for (int i = 0; i < a.Length; i++) a[i] = ri; } void ReadArray(out long[] a, int n) { a = new long[n]; for (int i = 0; i < a.Length; i++) a[i] = rl; } void ReadArray(out T[] a, int n, Func read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(); } void ReadArray(out T[] a, int n, Func read) { a = new T[n]; for (int i = 0; i < a.Length; i++) a[i] = read(i); } } static class Program { static public void Main(string[] args) { SourceExpander.Expander.Expand(); Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver(); Console.Out.Flush(); } } #region Expanded by https://github.com/kzrnm/SourceExpander public class Compresswhere T:notnull,IComparable{public int Count{get;private set;}=0;private readonly HashSet_set;private readonly Dictionary_dic;private T[]_data;public Compress(){_set=new HashSet();_dic=new Dictionary();}public Compress(ReadOnlySpana){_set=new HashSet();_dic=new Dictionary();foreach(var v in a)Add(v);Build();}public void Add(T x)=>_set.Add(x);public void Build(){Count=_set.Count;_dic.Clear();_data=_set.ToArray();Array.Sort(_data);for(int i=0;i<_data.Length;i++)_dic.Add(_data[i],i);}public int GetIndex(T x)=>_dic[x];public T this[int i]{get=>_data[i];}public bool Contains(T x)=>_set.Contains(x);public int LowerBound(T v){int n=_data.Length;if(n==0)return-1;int l=0,r=n;while(l{T Identity{get;}F FIdentity{get;}T Operate(T x,T y);T Mapping(F f,T x);F Composition(F f,F g);} public class LazySegTreewhere Op:struct,ILazySegTreeOperator{protected static readonly Op op=default;public int Length{get;}protected readonly int size,log;protected readonly T[]d;protected readonly F[]lz;public LazySegTree(int n){Length=n;log=0;while((1<=1;i--)Update(i);}[MethodImpl(256)]public void Clear(){Array.Fill(d,op.Identity);Array.Fill(lz,op.FIdentity);}[MethodImpl(256)]public void Set(int p,T x){p+=size;for(int i=log;i>=1;i--)Push(p>>i);d[p]=x;for(int i=1;i<=log;i++)Update(p>>i);}[MethodImpl(256)]public T Get(int p){p+=size;for(int i=log;i>=1;i--)Push(p>>i);return d[p];}[MethodImpl(256)]public T Prod(int l,int r){if(l==r)return op.Identity;l+=size;r+=size;for(int i=log;i>=1;i--){if(((l>>i)<>i);if(((r>>i)<>i);}T sml=op.Identity,smr=op.Identity;while(l>=1;r>>=1;}return op.Operate(sml,smr);}public T AllProd()=>d[1];[MethodImpl(256)]public void Apply(int p,F f){p+=size;for(int i=log;i>=1;i--)Push(p>>i);d[p]=op.Mapping(f,d[p]);for(int i=1;i<=log;i++)Update(p>>i);}[MethodImpl(256)]public void Apply(int l,int r,F f){if(l>=r)return;l+=size;r+=size;for(int i=log;i>=1;i--){if(((l>>i)<>i);if(((r>>i)<>i);}{int l2=l,r2=r;while(l>=1;r>>=1;}l=l2;r=r2;}for(int i=1;i<=log;i++){if(((l>>i)<>i);if(((r>>i)<>i);}}[MethodImpl(256)]protected void Update(int k)=>d[k]=op.Operate(d[2*k],d[2*k+1]);[MethodImpl(256)]protected virtual void AllApply(int k,F f){d[k]=op.Mapping(f,d[k]);if(kf){if(l==Length)return Length;l+=size;for(int i=log;i>=1;i--)Push(l>>i);var s=op.Identity;do{while(l%2==0)l>>=1;if(!f(op.Operate(s,d[l]))){while(lf){if(r==0)return 0;r+=size;for(int i=log;i>=1;i--)Push((r-1)>>i);var s=op.Identity;do{r--;while(r>1&&(r%2)!=0)r>>=1;if(!f(op.Operate(d[r],s))){while(r>1)&0x5555555555555555UL);x=(x&0x3333333333333333UL)+((x>>2)&0x3333333333333333UL);x=(x&0x0f0f0f0f0f0f0f0fUL)+((x>>4)&0x0f0f0f0f0f0f0f0fUL);x=(x&0x00ff00ff00ff00ffUL)+((x>>8)&0x00ff00ff00ff00ffUL);x=(x&0x0000ffff0000ffffUL)+((x>>16)&0x0000ffff0000ffffUL);x=(x&0x00000000ffffffffUL)+((x>>32)&0x00000000ffffffffUL);return(int)x;}[MethodImpl(256)]public static int Popcount(long x){x=(x&0x5555555555555555L)+((x>>1)&0x5555555555555555L);x=(x&0x3333333333333333L)+((x>>2)&0x3333333333333333L);x=(x&0x0f0f0f0f0f0f0f0fL)+((x>>4)&0x0f0f0f0f0f0f0f0fL);x=(x&0x00ff00ff00ff00ffL)+((x>>8)&0x00ff00ff00ff00ffL);x=(x&0x0000ffff0000ffffL)+((x>>16)&0x0000ffff0000ffffL);x=(x&0x00000000ffffffffL)+((x>>32)&0x00000000ffffffffL);return(int)x;}[MethodImpl(256)]public static int Popcount(int x){x=(x&0x55555555)+((x>>1)&0x55555555);x=(x&0x33333333)+((x>>2)&0x33333333);x=(x&0x0f0f0f0f)+((x>>4)&0x0f0f0f0f);x=(x&0x00ff00ff)+((x>>8)&0x00ff00ff);x=(x&0x0000ffff)+((x>>16)&0x0000ffff);return x;}[MethodImpl(256)]public static int Ctz(long x){if(x==0)return-1;return Popcount((ulong)((x&-x)-1));}[MethodImpl(256)]public static int CeilPow2(int n){int x=0;while((1<a<=b&&b<=c;[MethodImpl(256)]public static int Sign(long x)=>x==0?0:(x<0?-1:1);[MethodImpl(256)]public static int Sign(double x)=>x==0?0:(x<0?-1:1);[MethodImpl(256)]public static int DigitSum(long n,int d=10){long s=0;while(n>0){s+=n%d;n/=d;}return(int)s;}[MethodImpl(256)]public static long Floor(long a,long b)=>a>=0?a/b:(a+1)/b-1;[MethodImpl(256)]public static long Ceil(long a,long b)=>a>0?(a-1)/b+1:a/b;[MethodImpl(256)]public static long Gcd(long a,long b){if(a==0)return Math.Abs(b);if(b==0)return Math.Abs(a);if(a<0)a=-a;if(b<0)b=-b;int u=Ctz(a);int v=Ctz(b);a>>=u;b>>=v;while(a!=b){if(a>=Ctz(a);}return a<(ref T x,ref T y){T t=y;y=x;x=t;}[MethodImpl(256)]public static T Clamp(T x,T l,T r)where T:IComparable =>x.CompareTo(l)<=0?l:(x.CompareTo(r)<=0?x:r);[MethodImpl(256)]public static T Clamp(ref T x,T l,T r)where T:IComparable =>x=x.CompareTo(l)<=0?l:(x.CompareTo(r)<=0?x:r);[MethodImpl(256)]public static void Chmin(ref T x,T y)where T:IComparable{if(x.CompareTo(y)>0)x=y;}[MethodImpl(256)]public static void Chmax(ref T x,T y)where T:IComparable{if(x.CompareTo(y)<0)x=y;}[MethodImpl(256)]public static int LowerBound(long[]arr,long val,int l=-1,int r=-1)=>LowerBound(arr.AsSpan(),t=>Sign(t-val),l,r);[MethodImpl(256)]public static int LowerBound(int[]arr,int val,int l=-1,int r=-1)=>LowerBound(arr.AsSpan(),t=>t-val,l,r);[MethodImpl(256)]public static int LowerBound(T[]arr,T val,int l=-1,int r=-1)where T:IComparable =>LowerBound(arr.AsSpan(),t=>t.CompareTo(val),l,r);[MethodImpl(256)]public static int LowerBound(T[]arr,Funccomp,int l=-1,int r=-1)=>LowerBound(arr.AsSpan(),comp,l,r);[MethodImpl(256)]public static int LowerBound(Spandata,Funccomp,int l=-1,int r=-1){if(data.Length==0)return-1;if(l==-1)l=0;if(r==-1)r=data.Length;while(l(T[]arr,T geq,T lt,int l=-1,int r=-1)where T:IComparable =>Math.Max(0,LowerBound(arr.AsSpan(),t=>t.CompareTo(lt),l,r)-LowerBound(arr.AsSpan(),t=>t.CompareTo(geq),l,r));[MethodImpl(256)]public static string ToBase2(long v,int digit=-1){if(digit==-1){digit=0;while((v>>digit)>0)digit++;}var c=new string[digit];for(int i=0;i>i)&1)==0?"0":"1";return string.Join("",c);}[MethodImpl(256)]public static string ToBaseN(long v,int n,int digit=-1){if(digit==-1){digit=0;long pow=1;while(v>=pow){digit++;pow*=n;}}var c=new int[digit];for(int i=0;i=len){ptr=0;if((len=str.Read(buf,0,1024))<=0){isEof=true;return 0;}}return buf[ptr++];}[MethodImpl(256)]public char Char(){byte b;do b=Read();while(b<33||126=33&&b<=126;b=(char)Read())sb.Append(b);return sb.ToString();}[MethodImpl(256)]public long Integer(){long ret=0;var ng=false;byte b;do b=Read();while(b!='-'&&(b<'0'||'9'double.Parse(Scan());}} namespace Lib{public static class OutputLib{[MethodImpl(256)]public static void WriteJoin(string s,IEnumerablet)=>Console.WriteLine(string.Join(s,t));[MethodImpl(256)]public static void WriteMat(T[,]a,string sep=" "){int sz1=a.GetLength(0),sz2=a.GetLength(1);var b=new T[sz2];for(int i=0;i(T[][]a,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar);}[MethodImpl(256)]public static void WriteMat(T[][]a,Funcmap,string sep=" "){foreach(var ar in a)WriteJoin(sep,ar.Select(x=>map(x)));}[MethodImpl(256)]public static void Write(object t)=>Console.WriteLine(t.ToString());[MethodImpl(256)]public static void Write(params object[]arg)=>Console.WriteLine(string.Join(" ",arg.Select(x=>x.ToString())));[MethodImpl(256)]public static void Write(string str)=>Console.WriteLine(str);[MethodImpl(256)]public static void WriteFlush(object t){Console.WriteLine(t.ToString());Console.Out.Flush();}[MethodImpl(256)]public static void WriteError(object t)=>Console.Error.WriteLine(t.ToString());[MethodImpl(256)]public static void Flush()=>Console.Out.Flush();[MethodImpl(256)]public static void YN(bool t)=>Console.WriteLine(t?"YES":"NO");[MethodImpl(256)]public static void Yn(bool t)=>Console.WriteLine(t?"Yes":"No");[MethodImpl(256)]public static void yn(bool t)=>Console.WriteLine(t?"yes":"no");[MethodImpl(256)]public static void DeleteLine()=>Console.Write("\x1b[1A\x1b[2K");[MethodImpl(256)]public static void ProgressBar(long now,long total,int blocks=50){int x=(int)((2*now*blocks+1)/(2*total));Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_",x))}\x1b[0m{string.Concat(Enumerable.Repeat("_",blocks-x))}] : {now} / {total}");}}} namespace SourceExpander{public class Expander{[Conditional("EXP")]public static void Expand(string inputFilePath=null,string outputFilePath=null,bool ignoreAnyError=true){}public static string ExpandString(string inputFilePath=null,bool ignoreAnyError=true){return "";}}} #endregion Expanded by https://github.com/kzrnm/SourceExpander