#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef tuple<int,int,int> t3;

using namespace std;

int n,m;

#define MAX_N 1000010

int x[MAX_N];
int a[MAX_N];
int b[MAX_N];

vector<int> ai[MAX_N];
vector<int> bi[MAX_N];
int c[10];

int two()
{
    return c[2] + c[3] + c[4] + c[5];
}

int three()
{
    return c[3] + c[4] + c[5];
}

void solve()
{
    cin >> n >> m;
    for(int i = 0;i < n;i++)
    {
        cin >> x[i] >> a[i] >> b[i];
        ai[a[i]].push_back(i);
        bi[b[i]].push_back(i);
    }
    //b max
    for(int i = 0;i < n;i++)
    {
        x[i]++;
        c[x[i]]++;
    }
    ll ans = 1e15;
    int cb = 1000001;
    for(int ca = 0; ca < 1000001;ca++)
    {
        while(two() < m)
        {
            cb--;
            if(cb < 0) break;
            for(auto i : bi[cb])
            {
                c[x[i]]--;
                x[i]++;
                c[x[i]]++;
            }
        }
        if(two() < m) break;
        ans = min(ans, (ll)three());
        for(auto i : ai[ca])
        {
            c[x[i]]--;
            x[i]--;
            c[x[i]]++;
        }
    }
    cout << ans << endl;
}

int main()
{
    solve();
    return 0;
}