#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; class AhoCorasick { private: using AC = AhoCorasick*; vector ac; map next; AC fail, dnx; void add(const string& s, int pos, int id){ if(pos == (int)s.size()){ ac.push_back(id); return; } if(!next[s[pos]]) next[s[pos]] = new AhoCorasick(); next[s[pos]]->add(s,pos+1,id); } AC count(vector& res){ if(!fail) return this; for(int id : ac) res[id]++; if(dnx) dnx->count(res); else dnx = fail->count(res); return ac.size() ? this : dnx; } public: AhoCorasick() : fail(nullptr), dnx(nullptr){} static AC build(vector& pattern){ int sz = (int)pattern.size(); AC t = new AhoCorasick(); rep(i,sz) t->add(pattern[i],0,i); queue que; que.push(t); t->fail = nullptr; while(!que.empty()){ AC nw = que.front(); que.pop(); for(auto p : nw->next){ int i = p.first; AC fail = nw->fail; while(fail && !fail->next.count(i)){ fail = fail->fail; } nw->next[i]->fail = (!fail ? t : fail->next[i]); que.push(nw->next[i]); } } return t; } void match(vector& res, const string& s, int pos){ if(pos == (int)s.size()) return; if(next[s[pos]]){ next[s[pos]]->count(res); next[s[pos]]->match(res,s,pos+1); }else{ if(!fail) match(res,s,pos+1); else fail->match(res,s,pos); } } }; int main() { string s; cin >> s; int m; cin >> m; vector t(m); rep(i,m){ cin >> t[i]; } AhoCorasick ac; auto res = ac.build(t); vector ans(m,0); res->match(ans,s,0); cout << accumulate(all(ans),0) << "\n"; return 0; }