#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
#include <list>
#include <numeric>
using namespace std;
 
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<int, ll> i_ll;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
 
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define pb push_back
 
int INF = INT_MAX / 10;
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

struct aho_corasick {
	int N, M;
	vector<vector<int> > next, accepts, uss;
	void dfs(int i, string& s, int j, int u) {
		if (j == s.length()) {
			accepts[u].pb(i);
			return;
		}
		int k = s[j] - 'A' + 1;
		if (next[u][k] == -1) {
			next.pb(vector<int>(27, -1));
			accepts.pb({});
			if (j + 1 == uss.size()) uss.pb({});
			uss[j + 1].pb(M);
			next[u][k] = M++;
		}
		dfs(i, s, j + 1, next[u][k]);
	}
	aho_corasick(vector<string> patterns) {
		N = patterns.size(); M = 1;
		next.pb(vector<int>(27, -1));
		accepts.pb({});
		uss.pb({0});
		rep(i, N) dfs(i, patterns[i], 0, 0);
		for (vector<int> us: uss)
			for (int u: us)
				for (int k = 1; k <= 26; k++) {
					if (next[u][k] == -1) continue;
					int v;
					for (v = next[u][0]; v != -1 && next[v][k] == -1; v = next[v][0]);
					next[next[u][k]][0] = (v == -1 ? 0 : next[v][k]);
				}
	}
	vector<int> search(string s) {
		vector<int> freq(M);
		int u = 0;
		for (char c: s) {
			int k = c - 'A' + 1;
			for (; u != -1 && next[u][k] == -1; u = next[u][0]);
			u = (u == -1 ? 0 : next[u][k]);
			freq[u]++;
		}
		vector<int> ans(N);
		for (int j = uss.size() - 1; j > 0; j--)
			for (int u: uss[j]) {
				for (int i: accepts[u]) ans[i] = freq[u];
				freq[next[u][0]] += freq[u];
			}
		return ans;
	}
};

int main() {
	string s; cin >> s;
	int N; cin >> N;
	vector<string> patterns(N);
	rep(i, N) cin >> patterns[i];
	aho_corasick ac(patterns);
	vector<int> a = ac.search(s);
	cout << accumulate(a.begin(), a.end(), 0LL) << endl;
}