#include <cstdio>   
#include <cstring>   
#include <vector>  

using namespace std;   
  
#define file_in "abc2.in"   
#define file_out "abc2.out"  

#define Nmax 10000005   
#define Mod 666013   
  
int N; 
char ta[Nmax];   
int n;   
vector <int> h[Mod+25];   
int sol=0;   
  
void add(int x)   
{   
    int k=x%Mod;   
    for(vector <int>::iterator it=h[k].begin(); it!=h[k].end(); ++it)   
        if (*it==x)   
            return;   
    h[k].push_back(x);   
}   
  
int search(int x)   
{   
    int k=x%Mod;   
    for(vector <int>::iterator it=h[k].begin(); it!=h[k].end(); ++it)   
        if (*it==x)   
            return 1;   
    return 0;   
}   
  
void citire()   
{   
    char s[25];
	int i;
	
    fgets(ta,Nmax,stdin);   
    N=strlen(ta)-1;   
    fgets(s,25,stdin);   
    n=strlen(s)-1;   
	
    do  
    {   
        int nr=0;   
        for (i=0;i<n;++i)   
            nr=nr*3+(s[i]-'a');   
        add(nr);   
    }   
    while(fgets(s,25,stdin));   
}   
  

void solve()   
{   
    int nr=0,mod=1,i;   
    
	for(i=0;i<n-1;++i)   
    {   
        nr=nr*3+(ta[i]-'a');   
        mod*=3;   
    }   
	
    for(i=n-1;i<N;++i)   
    {   
        nr=(nr%mod)*3+(ta[i]-'a');   
        sol+=search(nr);   
    }   
}   
  
void afisare()
{
	printf("%d", sol);
}

int main()   
{   
    freopen(file_in,"r",stdin);   
    freopen(file_out,"w",stdout);   
    
	citire();   
    solve();   
    afisare();

	fclose(stdin);
	fclose(stdout);
	
    return 0;   
}