import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int N, K; int[] S, P, U; void main() { try { for (; ; ) { N = readInt(); K = readInt(); S = new int[N]; P = new int[N]; U = new int[N]; foreach (i; 0 .. N) { S[i] = readInt(); P[i] = readInt(); U[i] = readInt(); } const limU = U.maxElement + 1; alias Team = Tuple!(int, "s", int, "c", int, "p", int, "id"); auto tss = new Team[][limU]; foreach (i; 0 .. N) { tss[U[i]] ~= Team(-S[i], 0, P[i], i); } auto cs = new int[N]; foreach (u; 0 .. limU) { tss[u].sort; foreach (j; 0 .. cast(int)(tss[u].length)) { cs[tss[u][j].id] = j; } } auto teams = new Team[N]; foreach (i; 0 .. N) { teams[i] = Team(-S[i], cs[i], P[i], i); } teams.sort; foreach (i; 0 .. K) { writeln(teams[i].id); } } } catch (EOFException e) { } }