using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Diagnostics;
using System.Collections.Generic;
using System.Text.RegularExpressions;
using Enu = System.Linq.Enumerable;

class Program
{
    void Solve()
    {
        int N = reader.Int(), Limit = reader.Int();
        var P = reader.IntGrid(N);
        var Xs = P.Select(a => a[0]).Distinct().OrderBy(x => x).ToArray();
        var Ys = P.Select(a => a[1]).Distinct().OrderBy(y => y).ToArray();

        for (int i = 0; i < N; i++)
        {
            P[i][0] = Array.BinarySearch(Xs, P[i][0]);
            P[i][1] = Array.BinarySearch(Ys, P[i][1]);
        }
        int ans = 0;
        for (int y1 = 0; y1 < Ys.Length; y1++)
            for (int y2 = y1; y2 < Ys.Length; y2++) 
            {
                int[] ColCount = new int[N], ColPt = new int[N];
                foreach (var p in P)
                    if (p[1] >= y1 && p[1] <= y2)
                    {
                        ColCount[p[0]]++;
                        ColPt[p[0]] += p[2];
                    }
                int L = 0, R = 0, count = 0, pt = 0;
                while (L < N && R < N)
                {
                    count += ColCount[R];
                    pt += ColPt[R];
                    R++;
                    if (L <= R && pt <= Limit) ans = Math.Max(ans, count);
                    else { count -= ColCount[L]; pt -= ColPt[L++]; }
                }
            }

        Console.WriteLine(ans);
    }





    Reader reader = new Reader(Console.In);
    static void Main() { new Program().Solve(); }
}

class Reader
{
    private readonly TextReader reader;
    private readonly char[] separator = { ' ' };
    private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries;
    private string[] A = new string[0];
    private int i;

    public Reader(TextReader r) { reader = r; }
    public Reader(string file) { reader = new StreamReader(file); }
    public bool HasNext() { return Enqueue(); }
    public string String() { return Dequeue(); }
    public int Int() { return int.Parse(Dequeue()); }
    public long Long() { return long.Parse(Dequeue()); }
    public double Double() { return double.Parse(Dequeue()); }
    public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); }
    public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); }
    public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); }
    public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); }
    public string Line() { return reader.ReadLine().Trim(); }
    private string[] Split(string s) { return s.Split(separator, removeOp); }
    private bool Enqueue()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return Enqueue();
        A = Split(line);
        i = 0;
        return true;
    }
    private string Dequeue() { Enqueue(); return A[i++]; }
}