#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)




const int NUMC = 26;
struct Trie {
	vector<vector<int>> V;
	vector<int> C;
	void create(vector<string> S) {
		V.clear();
		V.push_back(vector<int>(NUMC + 1));
		C.push_back(0);
		sort(S.begin(), S.end());
		for (string s : S) {
			int cur = 0;
			for (char _c : s) {
				int c = _c - 'A';
				if (V[cur][c + 1] == 0) {
					V.push_back(vector<int>(NUMC + 1));
					V[cur][c + 1] = V.size() - 1;
					C.push_back(0);
				}
				cur = V[cur][c + 1];
			}
			C[cur]++;
		}
	}
	int next(int cu, char c) {
		assert(cu < V.size());
		return V[cu][c - 'A' + 1];
	}
};
//-----------------------------------------------------------------
string S;
int M;
vector<string> C;
Trie trie;
int dp[50101][1010];
//-----------------------------------------------------------------
int main() {
	cin >> S >> M;
	rep(i, 0, M) {
		string s;
		cin >> s;
		C.push_back(s);
	}

	trie.create(C);

	int ans = 0;
	int N = S.length();
	int NN = trie.V.size();

	rep(i, 0, N) {
		dp[i][0] = 1;
		rep(j, 0, NN) if(0 < dp[i][j]) dp[i + 1][trie.next(j, S[i])] += dp[i][j];
		rep(j, 0, NN) if (0 < trie.C[j]) ans += dp[i + 1][j];
	}

	cout << ans << endl;
}