#include <iostream>
#include <fstream>
#include <unordered_map>

using namespace std;

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

unordered_map <string, bool> HASH;

int main(){
    string s, cuv;
    int max_size = -1;
    fin >> s;
    while(fin >> cuv)
        HASH.insert({cuv, true}), max_size = max(max_size, (int)cuv.size());
    int ans = 0;
    for(int i = 0; i < s.size(); i++){
        string test = "";
        for(int j = i; j <= min((int)s.size() - 1, i + max_size - 1); j++){
            test += s[j];
            if(HASH[test]) ans++;
        }
    }
    fout << ans;
    return 0;
}