using System;
using System.Linq;
using System.Collections.Generic;
//using System.Numerics;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using Number = System.Int64;
using KV = System.Collections.Generic.KeyValuePair<int, long>;
namespace Program {
    public class Solver {
        public void Solve() {
            var n = ri;
            var T = ri;
            var a = Enumerate(n, x => new int[] { ri, ri, ri });
            var cht = Enumerate(T + 1, x => new Optimization.SimpleCHT());
            for (int i = 0; i <= T; i++)
                cht[i].AddLine(0, 2 * INF);
            var ans = 0L;
            foreach (var x in a.OrderBy(x => x[2])) {
                var dt = x[0];
                var v = x[1];
                var f = x[2];
                for (int t = T - dt; t >= 0; t--) {
                    var u = -cht[t].Get(f) - (f * f) + v;
                    if (u < -INF) u = v;
                    ans = Math.Max(ans, u);
                    cht[t + dt].AddLine(-2 * f, -u + f * f);
                }
            }
            Console.WriteLine(ans);
        }
        const long INF = 1L << 30;

        //int[] dx = { -1, 0, 1, 0 };
        //int[] dy = { 0, 1, 0, -1 };
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f(i);
            return a;
        }

        static public void Swap<T>(ref T a, ref T b) {
            var tmp = a;
            a = b;
            b = tmp;
        }
    }
}

#region main

static class Ex {
    static public string AsString(this IEnumerable<char> ie) {
        return new string(ie.ToArray());
    }

    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }

    static public void Main() {
        Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}

#endregion
#region Ex

namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider {
            get { return CultureInfo.InvariantCulture; }
        }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) {
            str = stream;
        }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream {
            get { return isEof; }
        }

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0) {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }

        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }

        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }

        public long Long() {
            return isEof ? long.MinValue : long.Parse(Scan());
        }

        public int Integer() {
            return isEof ? int.MinValue : int.Parse(Scan());
        }

        public double Double() {
            return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture);
        }
    }
}

#endregion

#region Convex hull trick
namespace Optimization {
    using N = System.Int64;
    struct L {
        internal N a, b;
        /// <summary>
        /// u*x+v
        /// </summary>
        public L(N u, N v) : this() { a = u; b = v; }

        /// <summary>
        /// F(x)=a*x+b
        /// </summary>
        public N F(int x) { return a * x + b; }
    }
    /// <summary>
    /// ?????????????????´?????????????????????????°????min ax+b????±???????
    /// </summary>
    public class SimpleCHT {
        int s, t;
        List<L> deq = new List<L>();
        /// <summary>
        /// ax+b ?????????
        /// a?????????????°???§????????¨??????,?????????O(1)
        /// </summary>
        public void AddLine(N a, N b) {
            var l = new L(a, b);
            while (s + 1 < t && check_fast(deq[t - 2], deq[t - 1], l)) { t--; deq.RemoveAt(t); }
            deq.Add(l);
            t++;
        }
        /// <summary>
        /// x??????????¢?????????¨??????????????£?????????,?????????O(1)
        /// </summary>
        public N Get(int x) {
            while (s + 1 < t && deq[s].F(x) >= deq[s + 1].F(x)) s++;
            return deq[s].F(x);
        }

        /// <summary>
        /// x??????????¢??????§????????¨?????§????????????,O(logN)
        /// </summary>
        /// <param name="x"></param>
        /// <returns></returns>
        public N Query(int x) {
            var l = s - 1; var h = t - 1;
            while (l + 1 < h) {
                var m = (l + h) / 2;
                if (isR_fast(deq[m], deq[m + 1], x)) l = m;
                else h = m;
            }
            return deq[h].F(x);

        }

        /// <summary>
        /// ax,b????°???????
        /// </summary>
        private bool isR_fast(L l1, L l2, int x) {
            return (l1.b - l2.b) >= x * (l2.a - l1.a);
        }

        /// <summary>
        /// a*b????°???????
        /// </summary>
        private bool check_fast(L l1, L l2, L l3) {
            return (l2.a - l1.a) * (l3.b - l2.b) >= (l2.b - l1.b) * (l3.a - l2.a);
        }
    }
}
#endregion


Measured memory_bytes: 174904