#include <cstdio>
#include <map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
struct node{
    string a;
    int Num;
    bool operator < (const node &fuck)const{
        if(Num==fuck.Num){
            if(a.length() == fuck.a.length() ) return a < fuck.a;
            else return a.length() < fuck.a.length();
        }
        return Num > fuck.Num;
    }
}Str[200010];
int cnt,ans,tot,x,y,n;
string f,s;
map<string,bool>exi;
map<string,int>num;

int main(){
    scanf("%d%d%d",&x,&y,&n);
    while(cin>>f) s+=f;
    for(register int i=0;i<=s.length()-1;i++){
        for(register int j=x;j<=y;j++){
            if(i+j > s.length()) continue;
            string ss = s.substr(i,j);
            //cout<<ss<<endl;
            if(!exi[ss]){
                 exi[ss]=1;
                num[ss]++;
                Str[++cnt].a=ss;
            }
            else num[ss]++;
        }
    }
    for(int i=1;i<=cnt;i++) Str[i].Num = num[Str[i].a];
    sort(Str+1,Str+1+cnt);
    for(int i=1;i<=cnt;i++){
        printf("%d\n",Str[i].Num);
        ans = 0;
        while(Str[i].Num==Str[i+1].Num){
            cout<<Str[i].a;
            ans++;
            if(ans%6==0) printf("\n");
            else printf(" ");
            i++;
        }
        cout<<Str[i].a<<endl;
        if(++tot==n) break;
    }
    return 0;
}