#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e18)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))




// http://perogram.hateblo.jp/entry/rolling_hash
vector<ll> rolling_hash_search(string s, string t){
	vector<ll> index_list;
	ll SL = s.size();
	ll TL = t.size();

	// b, hは互いに素 (gcd == 1)
	ll b = 1e6 + 7;
	ll h = 1e9 + 7;

	// 蟻本でいう、bのm乗
	ll a = 1;
	FOR(i, 0, TL){
		a *= b;
		a %= h;
	}
	
	// 先頭のローリングハッシュ
	ll s_hash = 0;
	FOR(i, 0, TL){
		s_hash = s_hash * b + s[i];
		s_hash %= h;    
	}

	ll t_hash = 0;
	FOR(i, 0, TL){
		t_hash = t_hash * b + t[i];
		t_hash %= h;    
	}

	// sの始点を1つずつ進めながらハッシュ値をチェック
	FOR(i, 0, SL - TL + 1){
		if(s_hash==t_hash){
			index_list.push_back(i);
		}

		if(i+TL<SL){
			s_hash = s_hash * b - s[i] * a + s[i+TL];
			s_hash %= h;
		}
	}

	return index_list;
}

int main(){
	string s,t;
	ll M,ans=0;
	cin >> s >> M;
	FOR(i,0,M){
		cin >> t;
		ans += rolling_hash_search(s, t).size();
	}
	cout << ans << endl;
	
	return 0;
}