#include using namespace std; typedef long long ll; typedef pair l_l; #define EPS (1e-7) #define INF (1e9) #define PI (acos(-1)) //const ll mod = 1000000007; template Z rng(Z a, Z b) { static mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); return uniform_int_distribution(a, b - 1)(mt); } struct RollingHash { static constexpr uint64_t P0 = 4e9 + 7; static constexpr uint64_t P1 = 4e9 + 9; static uint64_t B0; static uint64_t B1; static vector powB0; static vector powB1; const int n; vector h0; vector h1; template RollingHash(Itr first, Itr last) : n(distance(first, last)), h0(n + 1), h1(n + 1) { for (int i = 0; i < n; ++i, ++first) { h0[i + 1] = (h0[i] * B0 + *first) % P0; h1[i + 1] = (h1[i] * B1 + *first) % P1; } while (powB0.size() <= n) { powB0.push_back(powB0.back() * B0 % P0); powB1.push_back(powB1.back() * B1 % P1); } } uint64_t get0(int l, int r) { return (h0[r] + (P0 - h0[l]) * powB0[r - l]) % P0; } uint64_t get1(int l, int r) { return (h1[r] + (P1 - h1[l]) * powB1[r - l]) % P1; } bool eq(int l0, int r0, int l1, int r1) { return get0(l0, r0) == get0(l1, r1) and get1(l0, r0) == get1(l1, r1); } template static uint64_t get0(Itr first, Itr last) { uint64_t res = 0; while (first != last) { res = (res * B0 + *first++) % P0; } return res; } template static uint64_t get1(Itr first, Itr last) { uint64_t res = 0; while (first != last) { res = (res * B1 + *first++) % P1; } return res; } }; uint64_t RollingHash::B0 = rng(1, RollingHash::P0); uint64_t RollingHash::B1 = rng(1, RollingHash::P1); vector RollingHash::powB0{1}; vector RollingHash::powB1{1}; map, ll> mp; int main() { //cout.precision(10); cin.tie(0); ios::sync_with_stdio(false); ll M; string S; cin >> S >> M; ll ans = 0; RollingHash rhs(S.begin(), S.end()); for(int i = 0; i < S.size(); i++) { for(int j = 1; j <= 10; j++) { //cerr << i << " " << j << endl; if(i + j > S.size()) break; mp[{rhs.get0(i, i + j), rhs.get1(i, i + j)}]++; } } string C; while(M--) { cin >> C; uint64_t zero = RollingHash::get0(C.begin(), C.end()); uint64_t one = RollingHash::get1(C.begin(), C.end()); if(mp.count({zero, one}) == 0) continue; ans += mp[{zero, one}]; /* for(int i = 0; i + C.size() <= S.size(); i++) { //if(rhs.get0(i, i+C.size()) != RollingHash::get0(C.begin(), C.end())) continue; //if(rhs.get1(i, i+C.size()) != RollingHash::get1(C.begin(), C.end())) continue; if(rhs.get0(i, i+C.size()) != zero) continue; //if(rhs.get1(i, i+C.size()) != one) continue; ans++; } */ } cout << ans << endl; return 0; }