#include <iostream>
#include <unordered_map>
using namespace std;

int main() {
    string s, t, k; int ans = 0, m, w;
    unordered_map<string, int> um;
    cin >> s >> m;
    for (int i = 0; i < s.size(); ++i) {
        k = "";
        w = s.size() - i > 9 ? 10 : s.size() - i;
        for (int j = 0; j < w; ++j) {
            k += s[i + j];
            if(um.find(k) == um.end()){
                um[k] = 1;
            } else {
                ++um[k];
            }
        }
    }
    for (int i = 0; i < m; ++i) {
        cin >> t;
        ans += um[t];
    }
    cout << ans << endl;
    return 0;
}