#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
int main()
{
    string s;
    int m;
    cin >> s;
    cin >> m;
    map<string, int> mp;
    string p[100005];
    rep(i, m)
    {
        cin >> p[i];
    }
    lli ans = 0;
    for (int i = 0; i < s.size(); i++) {
        for (int j = 1; j <= 10 && i + j <= s.size(); j++) {
            mp[s.substr(i, j)]++;
        }
    }
    rep(i, m)
    {
        ans += mp[p[i]]++;
    }
    cout << ans << endl;
}