#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
string S;
using mint = modint998244353;
int M;
vector<string> T;

void solve(){
	ll base = 314;
	vector<mint> coef(S.size() );
	coef[0] = 1;
	for(int i = 1;i<S.size();i++) coef[i] = coef[i-1] * base;

	map<int,int> mp;
	for(int l = 1;l<11;l++){
		mint hashS = 0;
		for(int i = 0;i<l;i++){
			hashS = hashS*base + S[i];
		}
		for(int i = 0;i+l<=S.size();i++){
			mp[hashS.val()]++;
			if(i+l<S.size()) hashS = hashS*base + S[i+l] - coef[l]*S[i];
		}
	}

	int ans = 0;
	for(int i = 0;i<M;i++){
		mint hashT = 0;
		for(int j = 0;j<T[i].size();j++){
			hashT = hashT*base + T[i][j];
		}
		ans += mp[hashT.val()];
	}
	cout<<ans<<endl;

	
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> S >> M;
	T.resize(M);
	for(int i = 0; i < M; ++i) cin >> T[i];
	solve();
}