#include <iostream>
#include <fstream>
#include <algorithm>
#include <map>
#include <cstring>

using namespace std;

ifstream fin("abc2.in");
ofstream fout("abc2.out");

const int MAXKEY = 22;

string Search,S;

long long ans=0;

map <string, int> M;

int main()
{
    fin>>S;
    int p=S.size();
    p--;
    for(int i=0;i<=p;i++)
    {
        string a;
        for(int j=i;j<=min(p,i+MAXKEY-3);j++)
        {
            a+=S[j];
            M[a]++;
        }
    }
    while(fin>>Search)
    {
        ans+=M[Search];
        M[Search]=0;
    }
    fout<<ans<<'\n';
}