#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

struct RollingHash{
	ll M;
	vector<ll> H,B;
	RollingHash(string s,ll b=1009LL,ll m=1000000007LL){//999999937LL
		M = m;
		ll n = s.size();
		B.resize(n+1);
		H.resize(n+1,0);
		B[0] = 1;
		for(ll i=0;i<n;i++){
			B[i+1] = (B[i]*b)%M;
			H[i+1] = (H[i]*b%M+s[i])%M;
		}
	}
	ll GetHash(ll l,ll r){ // [l,r)
		return (H[r]+(M-B[r-l]*H[l]%M))%M;
	}
};


int main(){
	string S,C;
	ll M,ans=0,Sl;
	cin >> S >> M;
	Sl = S.size();
	map<ll,ll> ma1,ma2;
	RollingHash Shash1(S);
	RollingHash Shash2(S,9973,999999937);
	for(int i=0;i<M;i++){
		cin >> C;
		RollingHash Chash1(C);
		RollingHash Chash2(C,9973,999999937);
		ll cl = C.size();
		ll ch1 = Chash1.GetHash(0,cl);
		ll ch2 = Chash2.GetHash(0,cl);
		ma1[ch1]++;
		ma2[ch2]++;
	}
	for(int i=1;i<11;i++){
		for(int j=0;j<Sl-i+1;j++){
			ans += min(ma1[Shash1.GetHash(j,j+i)],ma2[Shash2.GetHash(j,j+i)]);
		}
	}
	cout << ans << endl;
}