#pragma region Macros #include using namespace std; template inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; } #ifdef DEBUG template ostream &operator<<(ostream &os, const pair &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template ostream &operator<<(ostream &os, const vector &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif struct Setup { Setup() { cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } __Setup; using ll = long long; #define OVERLOAD3(_1, _2, _3, name, ...) name #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define REP1(i, n) for(int i = 0; i < int(n); i++) #define REP2(i, a, b) for(int i = (a); i < int(b); i++) #define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__) #define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()) #define SZ(v) ((int)(v).size()) const int INF = 1 << 30; const ll LLINF = 1LL << 60; constexpr int MOD = 1000000007; constexpr int MOD2 = 998244353; const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, 1, 0, -1}; void Case(int i) { cout << "Case #" << i << ": "; } int popcount(int x) { return __builtin_popcount(x); } ll popcount(ll x) { return __builtin_popcountll(x); } #pragma endregion Macros template struct TrieNode { using Node = TrieNode; int cnt; array to; Node* failure_link; TrieNode(): cnt(0) { REP(i, 26) to[i] = nullptr; } }; template class AhoCorasick { public: AhoCorasick(): root(new Node()), is_called_build(false) {} void add_string(const string& s) { Node* now = root; for(const char& c : s) { if(now->to[c - base] == nullptr) { now->to[c - base] = new Node(); } now = now->to[c - base]; } now->cnt++; } void build() { queue que; REP(i, 26) { if(root->to[i] != nullptr) { root->to[i]->failure_link = root; que.push(root->to[i]); } else { root->to[i] = root; } } while(!que.empty()) { Node* now = que.front(); que.pop(); now->cnt += now->failure_link->cnt; REP(i, 26) { if(now->to[i] == nullptr) { now->to[i] = now->failure_link->to[i]; } else { now->to[i]->failure_link = now->failure_link->to[i]; que.push(now->to[i]); } } } is_called_build = true; } pair*> move(const char& c, TrieNode* now = nullptr) { if(now == nullptr) now = root; Node* nxt = now->to[c - base]; return {nxt->cnt, nxt}; } pair*> move(const string& s, TrieNode* now = nullptr) { if(now == nullptr) now = root; assert(is_called_build); ll sum = 0; for(const char& c : s) { auto [cnt, nxt] = move(c, now); sum += cnt; now = nxt; } return {sum, now}; } private: using Node = TrieNode; Node* root; bool is_called_build; }; int main() { string S; cin >> S; int M; cin >> M; AhoCorasick<26, 'A'> aho; REP(i, M) { string c; cin >> c; aho.add_string(c); } aho.build(); cout << aho.move(S).first << endl; }