#include <fstream>
#include <vector>
#include <string.h>

using namespace std;

const int MAX = 631;

vector<string> hashTable[MAX];
int length=0,ans=0;

vector<string>::iterator operation_search(string word,int index)
{
    vector<string>::iterator it;

    for(it = hashTable[index].begin(); it != hashTable[index].end(); ++it)
        if (*it == word)
            return it;

    return hashTable[index].end();
}

void operation_add(string word)
{
    int i,index=0;
    for(i=0;i<length;++i)
        index+=(i+1)*(word[i]-'a'+1);

     if(operation_search(word,index)==hashTable[index].end())
        hashTable[index].push_back(word);

}

int main()
{
    fstream f("abc2.in",ios::in);
    ofstream g("abc2.out");

    string text,word,temp;
    int length2,i,index=0,j;

    f>>text;

    while(f>>word)
        {
        if(!length)length=word.length();
        operation_add(word);
        }

    length2=text.length()-length+1;

    for(i=0;i<length2;++i)
        {
         temp.append(text,i,length);

         for(j=0;j<length;++j)
         index+=(j+1)*(temp[j]-'a'+1);

         if(operation_search(temp,index)!=hashTable[index].end())
            {
                ++ans;
            }
         temp.clear();
         index=0;
        }

    g<<ans;
    return 0;
}