#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#define MOD 666013
using namespace std;
int lungime,lim;
unsigned int put[20],a[50023];
vector<unsigned int>b[MOD];
char ch1[10000004],ch2[50023];
int ct=0;
void find(unsigned int a)
{
     int key=a%MOD;
     vector<unsigned int>::iterator it;
     for(it=b[key].begin();it!=b[key].end();++it)
     {
             if(*it==a) ct++;
     }
}
int main()
{
    freopen ("abc2.in","r",stdin);
    freopen ("abc2.out","w",stdout);
    scanf("%s",ch1);
    scanf("%s",ch2);
    lungime=strlen(ch2);
    lim=strlen(ch1);
    put[0]=1;
    for(int i=1;i<20;i++) put[i]=put[i-1]*3;
    unsigned int h1=0;
    for(int i=0;i<lungime;i++)
    {
        h1+=put[lungime-1-i]*(ch1[i]-'a');
    }
    b[h1%MOD].push_back(h1);
    for(int i=lungime;i<lim;i++)
    {
        h1-=((put[lungime-1]*(ch1[i-lungime]-'a')));
        h1*=3;
        h1+=(ch1[i]-'a');
        b[h1%MOD].push_back(h1);
    }
    int pos=0;
    while(1)
    {
        h1=0;
        for(int i=0;i<lungime;i++)
        {
            h1+=put[lungime-1-i]*(ch2[i]-'a');
        }
        a[++pos]=h1;
     //  printf("%d\n",h1);
        scanf("%s",ch2);
        if(feof(stdin)) break;
    }
    sort(a+1,a+pos+1);
    for(int i=1;i<=pos;i++)
    {
      //  printf("%u ",a[i]);
        if(a[i]!=a[i-1]) find(a[i]);
    }
    printf("%d\n",ct);
}