#include <bits/stdc++.h>
using namespace std;

ifstream in ("fraze.in");
ofstream out ("fraze.out");


int main()
{
    char sir[256], mat[100][256];
    int i=1, j, nr_p=0, nr_pp=0;
    in.get(sir,256);

    //in continuare le si citesc prin ceva chestie vazuta pe net cu eof si le si verific daca sunt pangrame, daca sunt le bag in matricea de siruri

    while(!in.eof())
    {
        in.get();
        in.get(sir,256);

        int s_L=0;
        for (j=0; j<=25; j++)
        {
            if (strchr(sir, char(97+j))!=NULL)  //verificam intai prin literel mici
                s_L++;
            else if (strchr(sir, char (65+j))!=NULL)  //verificam un echivalent litera mare
                s_L++;
        }

        if (s_L==26)
        {
            for (j=0; j<strlen(sir); j++)
                mat[i][j]=sir[j];   //le bag in matrice

            i++;

            nr_p++;
        }
    }

    int n=i-1;

    //in continuare verific care sunt pangramele perfecte

    for (i=1; i<=n; i++)
    {
        int ok=1;
        for (int k=0; k<strlen(mat[i]); k++)
            if((strchr (mat[i]+k+2, mat[i][k])!=NULL)&&(mat[i][k]!=',' && mat[i][k]!=' '))
                ok=0;

        if (ok)
            nr_pp++;
    }

    //aici sortez prin bule dar lexicografic

    bool sortat;
    do
    {
        sortat = true;
        for(int i = 1 ; i < n ; i ++)
            if(strcmp(mat[i], mat[i+1])>0)
            {
                char aux[256];
                strcpy (aux, mat[i]);
                strcpy(mat[i], mat[i+1]);
                strcpy(mat[i+1], aux);

                sortat=false;
            }
    }

    while(!sortat);



    out<<nr_p<<" "<<nr_pp<<endl;

    for (i=1; i<=n; i++)
        out<<mat[i]<<endl;


    return 0;
}