import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.SortedSet;
import java.util.TreeMap;
import java.util.TreeSet;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    int K = sc.nextInt();
    
    int[][][] table = new int[11][100001][];
    int[] ptr = new int[11];
    for (int i = 0; i < N; i ++) {
      int S = sc.nextInt();
      int P = sc.nextInt();
      int U = sc.nextInt();
      
      int[] d = new int[3];
      table[S][ptr[S]] = d;
      d[0] = P;
      d[1] = U;
      d[2] = i;
      ptr[S] ++;
    }

    for (int i = 0; i <= 10; i ++) {
      table[i] = Arrays.copyOf(table[i], ptr[i]);
    }
    

    int counter = 0;
    int[] uCount = new int[100001];
    for (int i = 10; i >= 0; i--) {

      TreeMap<Integer, SortedSet<int[]>> map = new TreeMap<>((a, b) ->  {
        return uCount[a] == uCount[b] ? a - b : uCount[a] - uCount[b];
      });
      
      for (int[] d : table[i]) {
        int U = d[1];
        if (!map.containsKey(U)) {
          map.put(U, new TreeSet<>((a, b) -> a[0] - b[0]));
        }
        map.get(U).add(d);
      }
      
      while (map.size() > 0) {
        SortedSet<int[]> set = map.firstEntry().getValue();
        map.remove(map.firstKey());
        int[] d = set.first();
        set.remove(d);
        
        System.out.println(d[2]);
        counter ++;
        uCount[d[1]] ++;
        
        if (counter == K) {
          return;
        }

        if (set.size() > 0) {
          map.put(d[1], set);
        }
      }
      
    }
    
  }

}


class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}