using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace yuki_433 { class Program { static int N, K; static HashSet L = new HashSet(); static int[] C = new int[100001]; static bool flag; static void Main(string[] args) { var sb = new StringBuilder(); var t = scan; N = t[0]; K = t[1]; for (int i = 0; i < N; i++) { t = scan; L.Add(new University(i, t[0], t[1], t[2])); } var A = L.OrderByDescending(l => l.S).ToArray(); var d = 0; var T = A; while (true) { T = A.Skip(d).ToArray(); int cnt = LowerBound(T, T[0].S); //Console.WriteLine(cnt); T = T.Take(cnt).ToArray(); d += cnt; //Console.WriteLine(T.Count()+" "+T[0].S); if(d >= K) { cnt -= d - K; flag = true; } for (int j = 0; j < cnt; j++) { T = T.OrderBy(a => C[a.U]).ThenBy(a => a.P).ToArray(); sb.AppendLine(T[0].Num.ToString()); C[T[0].U]++; T = T.Skip(1).ToArray(); } if (flag) { Console.Write(sb); return; } } } class University { internal int Num, S, P, U; public University(int Num, int S, int P, int U) { this.Num = Num; this.S = S; this.P = P; this.U = U; } } static int LowerBound(University[] arr, int val) { int low = 0, high = arr.Count(); int mid; while (low < high) { mid = ((high - low) >> 1) + low; if (arr[mid].S >= val) low = mid + 1; else high = mid; } return low; } static int[] scan { get { return Array.ConvertAll(Console.ReadLine().Split(), int.Parse); } } } }