#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
template <class T>
concept Streamable = requires(ostream os, T &x) { os << x; };
template <class mint>
concept is_modint = requires(mint &x) {
    { x.val() } -> std::convertible_to<int>;
};
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...)
#endif

template <Streamable T> void print_one(const T &value) { cout << value; }
template <is_modint T> void print_one(const T &value) { cout << value.val(); }
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    print_one(a);
    ((cout << ' ', print_one(b)), ...);
    cout << '\n';
}
template <ranges::range Iterable>
    requires(!Streamable<Iterable>)
void print(const Iterable &v) {
    for(auto it = v.begin(); it != v.end(); ++it) {
        if(it != v.begin())
            cout << " ";
        print_one(*it);
    }
    cout << '\n';
}
using ll = long long;
using vl = vector<ll>;
using vll = vector<vl>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
#define UNIQUE(v) ranges::sort(v), v.erase(unique(all(v)), end(v))
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 2 "/home/y_midori/cp/a.cpp"
constexpr int sigma = 26;
struct Node {
    int cnt = 0;
    Node *p, *fail;
    array<Node *, sigma> ch;
};
vector<unique_ptr<Node>> pool;
void solve();
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
}
void solve() {
    STR(s);
    INT(n);
    vector<string> t(n);
    input(t);
    pool.emplace_back(make_unique<Node>(Node()));
    Node *root = pool.back().get();
    for(const string &str : t) {
        Node *cur = root;
        for(auto c : str) {
            if(!(cur->ch[c - 'A'])) {
                pool.emplace_back(make_unique<Node>(Node()));
                pool.back()->p = cur;
                cur->ch[c - 'A'] = pool.back().get();
            }
            cur = cur->ch[c - 'A'];
        }
        cur->cnt += 1;
    }
    auto nex = [&](Node *cur, int c) -> Node * {
        while(cur) {
            if(cur->ch[c]) {
                return cur->ch[c];
            }
            cur = cur->fail;
        }
        return root;
    };
    // fail-link by bfs
    queue<Node *> q;
    for(q.push(root); !q.empty(); q.pop()) {
        auto cur = q.front();
        rep(i, sigma) if(cur->ch[i]) {
            Node *ch = cur->ch[i];
            ch->fail = nex(cur->fail, i);
            ch->cnt += ch->fail->cnt;
            q.push(ch);
        }
    }
    // auto dfs = [&](auto &self, Node *cur, string s) -> void {
    //     if(cur->cnt)
    //         print(s);
    //     for(int i = 0; i < 26; ++i) {
    //         if(cur->ch[i]) {
    //             s.push_back('A' + i);
    //             self(self, cur->ch[i], s);
    //             s.pop_back();
    //         }
    //     }
    // };
    // dfs(dfs, root, ""s);
    Node *cur = root;
    int ans = 0;
    for(auto c : s) {
        cur = nex(cur, c - 'A');
        ans += cur->cnt;
    }
    print(ans);
}