#include<bits/stdc++.h> using namespace std; struct hqg{ string name; int m,d; }a[188]; bool cmp(hqg x,hqg y){ if(x.name.size()!=y.name.size()) return x.name.size()<y.name.size(); return x.name<y.name; } int date[13][35]; int main(){ int n,s=0; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].name>>a[i].m>>a[i].d; date[a[i].m][a[i].d]++; } sort(a+1,a+n+1,cmp); for(int i=1;i<=12;i++){ for(int j=1;j<=31;j++){ if(date[i][j]>1){ s=1; cout<<i<<" "<<j<<" "; for(int k=1;k<=n;k++){ if(a[k].m==i&&a[k].d==j){ cout<<a[k].name<<" "; } } cout<<endl; } } } if(!s)cout<<"None"; return 0; }