import java.util.ArrayList;
import java.util.Comparator;
import java.util.Scanner;


public class Main {


	public static int c;
	public static void main(String[] args) {
		int n;
		ArrayList<Student> list=new ArrayList<Student>();
		Scanner scanner=new Scanner(System.in);
		while (scanner.hasNextInt()) {
			n=scanner.nextInt();
			c=scanner.nextInt();
			for (int i = 0; i < n; i++) {
				Student student=new Student();
				student.id=scanner.next();
				student.name=scanner.next();
				student.grade=scanner.nextInt();
				list.add(student);
			}
			list.sort(new Comparator<Student>() {


				@Override
				public int compare(Student arg0, Student arg1) {
					// TODO Auto-generated method stub
					if (c==1) {
						if (arg0.id.compareTo(arg1.id)>0) {
							return 1;
						}
						else {
							return-1;
						}
					}
					if (c==2) {
						if (arg0.name.compareTo(arg1.name)>0) {
							return 1;
						}
						else {
							return-1;
						}
					}
					if (c==3) {
						if (arg0.grade>arg1.grade) {
							return 1;
						}
						else {
							return-1;
						}
					}
					return -1;
				}
			});
			System.out.println("Case:");
			for (int i = 0; i < list.size(); i++) {
				System.out.println(list.get(i).id+" "+list.get(i).name+" "+list.get(i).grade);
			}
		}
	}
	public static class Student{
		String id;
		String name;
		int grade;
	}
}