#include #define ll long long #define INF 1000000005 #define MOD 1000000007 #define EPS 1e-10 #define rep(i,n) for(int i=0;i<(int)(n);++i) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i) #define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i) #define each(a,b) for(auto& (a): (b)) #define all(v) (v).begin(),(v).end() #define len(v) (int)(v).size() #define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end()) #define cmx(x,y) x=max(x,y) #define cmn(x,y) x=min(x,y) #define fi first #define se second #define pb push_back #define show(x) cout<<#x<<" = "<<(x)< P; typedef pair pll; typedef vector vi; typedef vector vvi; typedef vector vl; typedef vector vvl; typedef vector vd; typedef vector

vp; typedef vector vs; const int MAX_N = 100005; struct RH { static ll mod[2], mul[2]; static vector pm[2]; string s; int sz; vector hs[2]; void init(string& s){ this->s = s; sz = (int)s.size(); rep(i,2){ hs[i].resize(sz+1,0); if(pm[i].empty()) pm[i].push_back(1); rep(j,sz){ hs[i][j+1] = (hs[i][j]*mul[i]+s[j])%mod[i]; } } } pair hash(int l, int r) { //文字列sのインデックス[l,r)の部分文字列のハッシュ値 if(l>=r) return make_pair(0,0); ll res[2]; rep(i,2){ while((int)pm[i].size() <= r){ pm[i].push_back(pm[i].back()*mul[i]%mod[i]); } res[i] = (hs[i][r] + mod[i] - hs[i][l] * pm[i][r-l] % mod[i]) % mod[i]; } return make_pair(res[0],res[1]); } pair hash(string s) { init(s); return hash(0,(int)s.size()-1); } //文字列s全体のハッシュ値 }; vector RH::pm[2]; ll RH::mod[2]={1000000007, 1000000009}, RH::mul[2]={10009, 10007}; int contain(RH& arg1, string& arg2) { int res = 0; if(arg1.sz < len(arg2)){ return res; } RH rh; rh.init(arg2); rep(i,arg1.sz-len(arg2)+1){ if(arg1.hash(i,i+len(arg2)-1) == rh.hash(0,len(arg2)-1)){ res++; } } return res; } map mp; int main() { cin.tie(0); ios::sync_with_stdio(false); string s; cin >> s; RH rh; rh.init(s); srep(i,1,11){ rep(j,len(s)-i+1){ mp[rh.hash(j,i+j-1)]++; } } int n; cin >> n; vs vec(n); int ans = 0; rep(i,n){ cin >> vec[i]; RH cri; ans += mp[cri.hash(vec[i])]; } cout << ans << "\n"; return 0; }