#include<stdio.h>
#include<string.h>
//typedef struct nod {nod* c[3];} nod;
typedef struct nod {nod* c[3];int n;bool used;} nod;
nod *p,*q[21];
char N[30],lg;
//int pi[30];
//int i,maxcuv;
//long
long nr;
/*
//kmp comparare siruri
void PI()
{int k=0,i,n=strlen(N);
 pi[0]=pi[1]=0;
 for(i=1;i<n;i++)
 {while(k>0&&N[k]!=N[i])
   k=pi[k];
  if(N[k]==N[i]) k++;
  pi[i+1]=k;}}
int KMP()
{int n=strlen(N),m=strlen(M),i,k=0,nr=0;
 PI();
 for(i=0;i<m;i++)
 {while(k>0&&N[k]!=M[i])
   k=pi[k];
  if(N[k]==M[i]) k++;
  if(k==n) nr++; }
 return nr;}

nod* new_nod()
{nod *q=new nod;
 q->c[0]=q->c[1]=q->c[2]=0;
 return q;}

//verificare daca cuv exista deja
int new_word()
{int n=strlen(N),i;
 nod *q=p;
 int ok=0;
 for(i=0;i<n;i++)
 {if(!q->c[N[i]-'a'])
  {q->c[N[i]-'a']=new nod;
   (q->c[N[i]-'a'])->c[0]=(q->c[N[i]-'a'])->c[1]=(q->c[N[i]-'a'])->c[2]=0;
   ok=1;}
  q=q->c[N[i]-'a'];}
 return ok;}   */
nod* go(nod* q,char a)
{if(!q->c[a-'a'])
 {q->c[a-'a']=new nod;
  q=q->c[a-'a'];
  q->c[0]=q->c[1]=q->c[2]=0;
  q->n=1;
  q->used=0;
  return q;}
 q=q->c[a-'a'];
 q->n=q->n+1;
 return q;}

void build_arbore_solutii()
{q[0]=p;
 char c;int i,j;
 scanf("%c",&c);
 for(i=1;i<=lg&&c>='a'&&c<'d';i++)
  {for(j=i;j>0;j--)
    q[j]=go(q[j-1],c);
   scanf("%c",&c);}
 while(c>='a'&&c<'d')
  {for(j=lg;j>0;j--)
    q[j]=go(q[j-1],c);
   scanf("%c",&c);}}
 
int count()
{int i;
 nod*q=p;
 for(i=0;i<lg;i++)
  if(!q->c[N[i]-'a']) return 0;
  else q=q->c[N[i]-'a'];
 if(q->used) return 0;
 q->used=1;
 return q->n;}
int init()
{freopen("abc2.in","r",stdin);
 char M[10000010];
 scanf(" %s ",M);
 scanf(" %s ",M);
 lg=strlen(M);
 fclose(stdin);}

int main()
{init();
 freopen("abc2.in","r",stdin);
 freopen("abc2.out","w",stdout);
// p=new nod;p->c[1]=p->c[0]=p->c[2]=0;
 p=new nod;p->c[0]=p->c[1]=p->c[2]=0;
 build_arbore_solutii();
 while(!feof(stdin))
 {scanf(" %s ",N);
  nr=nr+count();
 }
 printf("%ld",nr);
 fclose(stdout);
 return 0;}