#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define ln '\n'
constexpr long long MOD = 1000000007LL;
//constexpr long long MOD = 998244353LL;
typedef long long ll;
typedef unsigned long long ull; 
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
///////////////////////////////////////////////////////////////////////////////////////////////////


template<class C>
struct SuffixAutomaton{
	struct State{
		int len,link;
		map<C,int> nex;
		State(int len,int link) : len(len), link(link) {}
	};
 
	vector<State> st;
    vector<long long> dp;
	int last;
 
	SuffixAutomaton() : last(0) {
		st.emplace_back(0,-1);
        dp.emplace_back(0);
	}
 
	int add(C c, long long val, int cur = -1) {
		if(cur == -1) {
			cur = last;
		}
 
		if(st[cur].nex.count(c) && st[st[cur].nex[c]].len == st[cur].len + 1) {
			int q = st[cur].nex[c];
            dp[q] += val;
			return last = q;
		}

        int p = cur;
		int nex = st.size();
		st.emplace_back(st[p].len+1,0);
        dp.emplace_back(val);
		while(p != -1 && !st[p].nex.count(c)) {
			st[p].nex[c] = nex;
			p = st[p].link;
		}
		if(p == -1){
            st[nex].link = 0;
			return last = nex;
		}
 
		int q = st[p].nex[c];
		if(st[p].len+1 == st[q].len) {
			st[nex].link = q;	
		} else {
			int clone = st.size();
			st.emplace_back(st[q]);
            dp.emplace_back(0);
			st[clone].len = st[p].len + 1;
 
			while (p != -1 && st[p].nex[c] == q) {
				st[p].nex[c] = clone;
				p = st[p].link;
			}
            st[q].link = st[nex].link = clone;
		}
		return last = nex;
	}
 
	
	vector<int> topologicalsort() {
		vector<int> ret;
		vector<int> deg(st.size());

		for(int i=0; i < st.size() ; i++) {
			for(auto &p:st[i].nex) deg[p.second]++;
		}
		queue<int> que;
		que.emplace(0);
		while(!que.empty()) {
			int v = que.front();
			que.pop();
			ret.emplace_back(v);
			for(auto &p : st[v].nex){
				if(--deg[p.second] == 0) que.emplace(p.second);
			}
		}
		return ret;
	}
 
	vector<int> suffixtree() {
		vector<int> ret;
 
		vector<vector<int>> G(st.size());
		for(int i = 1; i < st.size() ; i++) G[st[i].link].emplace_back(i);
		queue<int> que;
		que.emplace(0);
		while(!que.empty()) {
			int v = que.front();
			que.pop();
			ret.emplace_back(v);
			for(auto nv : G[v]) que.push(nv);
		}
		return ret;
	}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    string S; cin >> S;
    int N = S.size();
    SuffixAutomaton<char> SA;
    rep(i,N) SA.add(S[i],1);
    auto A = SA.suffixtree();
    for (int i = A.size()-1; i > 0; i--) SA.dp[SA.st[A[i]].link] += SA.dp[A[i]];

    int M; cin >> M;
    ll ans = 0;
    while (M--) {
        string T; cin >> T;
        int L = T.size();
        int cur = 0;
        rep(i,L) {
            if (!SA.st[cur].nex.count(T[i])) {
                cur = -1;
                break;
            }
            cur = SA.st[cur].nex[T[i]];
        }
        ans += cur == -1 ? 0 : SA.dp[cur];
    }

    cout << ans << ln;
}