#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 10000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 262144
int aced[200000] = {};
int itr[2] = {};
int getting[10] = {};
int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<tuple<int, int,int>> wow;
	vector<tuple<int, int, int>> upper;
	REP(i, n) {
		int a, b, c;
		cin >> a >> b >> c;
		aced[i] = a+1;
		getting[a+1]++;
		upper.push_back(make_tuple(c, b, i));
		wow.push_back(make_tuple(b, c,i));
	}
	sort(wow.begin(), wow.end());
	sort(upper.begin(), upper.end(), greater<tuple<int, int, int>>());
	int ans = 1000000;
	for (int i = -1;i <= 100000;++i) {
		while(itr[0] != n&&i == get<0>(wow[itr[0]])) {
			getting[aced[get<2>(wow[itr[0]])]]--;
			aced[get<2>(wow[itr[0]])]--;
			getting[aced[get<2>(wow[itr[0]])]]++;
			itr[0]++;
		}
		while (getting[2]+getting[3]+getting[4]+getting[5] < m) {
		gogo:;
			if (itr[1] == n) goto ok;
			getting[aced[get<2>(upper[itr[1]])]]--;
			aced[get<2>(upper[itr[1]])]++;
			getting[aced[get<2>(upper[itr[1]])]]++;
			itr[1]++;
			if (itr[1] != n&&get<0>(upper[itr[1]]) == get<0>(upper[itr[1] - 1])) goto gogo;
		}
		ans = min(ans, getting[3]+getting[4]+getting[5]);
	}
ok:;
	cout << ans << endl;
	return 0;
}