#line 1 "test/yukicoder/430.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/430"

#line 2 "string/ahocorasick.hpp"

#line 2 "string/trie.hpp"

#include<vector>
#include<string>
#include<cstring>
using namespace std;

template<int char_size,char margin,typename T,T (*e)()>
struct trie{
    struct node{
        int nxt[char_size];
        int par;
        T dat;
        node(int p):par(p){
            memset(nxt,-1,sizeof(nxt));
            dat = e();
        }
    };

    vector<node> nodes;
    int root;
    trie(){
        root = 0;
        nodes.push_back(node(-1));
    }

    int add(int ni,int i,const string&s){
        if(i==(int)s.size()) return ni;
        int now = s[i] - margin;
        if(nodes[ni].nxt[now]==-1){
            nodes[ni].nxt[now] = nodes.size();
            nodes.push_back(node(ni));
        }
        return add(nodes[ni].nxt[now],i+1,s);
    }

    int add(const string&s){
        return add(root,0,s);
    }

    int move(int ni,int i,const string&s){
        if(i==(int)s.size()) return ni;
        if(ni==-1) return ni;
        int now = s[i] - margin;
        return move(nodes[ni].nxt[now],i+1,s);
    }

    int move(int ni,const string&s){
        return move(ni,0,s);
    }

    int move(int ni,const char&c){
        string s(1,c);
        return move(ni,0,s);
    }

    int getpar(int ni){
        return nodes[ni].par;
    }

    inline T& operator[](int i) {
        return nodes[i].dat;
    }

    inline int size(){
        return nodes.size();
    }
};

/**
 * @brief Trie
 * @docs docs/string/trie.md
*/
#line 4 "string/ahocorasick.hpp"

#line 7 "string/ahocorasick.hpp"
using namespace std;

template<int char_size,int margin,typename T,T (*e)()>
struct aho_corasick:trie<char_size,margin,T,e> {
    vector<int> fail;
    vector<vector<int>> match;
    vector<int> bfs;
    aho_corasick(){}

    void build(){
        fail = vector<int>(this->size(),this->root);
        match = vector<vector<int>>(this->size(),vector<int>(char_size,-1));
        vector<pair<int,int>> que;
        vector<int> vis(this->size(),0);
        que.push_back(make_pair(this->root,this->root));
        vis[0] = 1;
        for(int i = 0;i<(int)que.size();i++){
            int ni = que[i].first;
            bfs.push_back(ni);
            int last = que[i].second;
            int nj = this->getpar(ni);
            if(ni!=this->root){
                fail[ni] = match[fail[nj]][last];
                if(fail[ni]==ni) fail[ni] = this->root;
                for(int j = 0;j<char_size;j++){
                    if(this->nodes[ni].nxt[j]!=-1) match[ni][j] = this->nodes[ni].nxt[j];
                    else match[ni][j] = match[fail[ni]][j];
                }
            }else{
                for(int j = 0;j<char_size;j++){
                    if(this->nodes[ni].nxt[j]!=-1) match[ni][j] = this->nodes[ni].nxt[j];
                    else match[ni][j] = ni;
                }
            }
            for(int j = 0;j<char_size;j++){
                if(this->nodes[ni].nxt[j]!=-1) que.push_back(make_pair(this->nodes[ni].nxt[j],j));
            }
        }
    }
    int move(int ni,int i,const string&s){
        if(i==(int)s.size()) return ni;
        return move(match[ni][s[i]-margin],i+1,s);
    }
    int move(int ni,const string&s){
        return move(ni,0,s);
    }
    int move(int ni,const char&c){
        string s(1,c);
        return move(ni,0,s);
    }
    int getfail(int ni){
        return fail[ni];
    }
    vector<int> getbfs(){
        return bfs;
    }
};

/**
 * @brief Aho-Corasick
 * @docs docs/string/ahocorasick.md
*/
#line 4 "test/yukicoder/430.test.cpp"

#include<algorithm>
#include<iostream>
#line 8 "test/yukicoder/430.test.cpp"
#include<cassert>

using namespace std;
using ll = long long;
int e(){
    return 0;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    aho_corasick<26,'A',int,e> t;
    string s;
    cin>>s;
    int m;
    cin>>m;
    for(int i = 0;i<m;i++){
        string c;
        cin>>c;
        int ni = t.add(c);
        t[ni]++;
    }
    t.build();
    vector<ll> cnt(t.size(),0);
    for(int i:t.getbfs()) cnt[i] += cnt[t.fail[i]] + t[i];
    ll ans = 0;
    int ni = 0;
    for(int i = 0;i<s.size();i++){
        ni = t.move(ni,s[i]);
        ans += cnt[ni];
    }
    cout<<ans<<endl;
}