#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;

int n, m, an[100000], anc[6];
map<int, vi> ah, bh;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m;
  FOR(i, 0, n){
    int x, a, b;
    cin >> x >> a >> b;
    ah[a].pb(i);
    bh[b].pb(i);
    an[i] = x+1;
    anc[x+1]++;
  }
  int ap = 100001, bp = 0, ans = iinf;
  while(ap >= 0 && bp < 100002){
    while(anc[2] + anc[3] + anc[4] + anc[5] < m){
      ap--;
      if(ap < 0)break;
      each(itr, ah[ap]){
        anc[an[*itr]]--;
        an[*itr]++;
        anc[an[*itr]]++;
      }
    }
    if(ap < 0)break;
    while(anc[2] + anc[3] + anc[4] + anc[5] >= m){
      mins(ans, anc[3] + anc[4] + anc[5]);
      each(itr, bh[bp]){
        anc[an[*itr]]--;
        an[*itr]--;
        anc[an[*itr]]++;
      }
      bp++;
      if(bp > 100001)break;
    }
  }
  cout << ans << endl;
  return 0;
}