1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std ;
 5 struct s
 6 {
 7     int n ;
 8     char name[10] ;
 9     int g ;
10 } ;
11 s t[100100] ;
12 bool c(s n, s name)
13 {
14     return n.n < name.n ;
15 }
16 bool cm(s n, s name)
17 {
18     if(strcmp(n.name, name.name) ==0)
19     return n.n < name.n ;
20     else
21     return strcmp(n.name , name.name ) < 0 ;
22 }
23 bool cmp(s n, s name)
24 {
25     if(n.g == name.g)
26     return n.n < name.n ;
27     else
28     return n.g < name.g ;
29     
30 }
31 int main()
32 {
33     int i, n, m, total=0  ;
34     while(~scanf("%d %d",&n, &m), n+m)
35     {
36         total++ ;
37         for(i=0; i<n; i++)
38         scanf("%d %s %d",&t[i].n, t[i].name, &t[i].g) ;
39         if(m == 1)
40         sort(t, t+n, c) ;
41         if(m == 2)
42         sort(t, t+n, cm) ;
43         if(m == 3)
44         sort(t, t+n, cmp) ;
45         printf("Case %d:\n", total) ;
46         for(i=0; i<n; i++)
47         printf("%06d %s %d\n",t[i].n, t[i].name , t[i].g ) ;
48     }
49     return 0 ;
50 }