#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t; using i64 = int64_t; using f64 = double_t; using str = string;
template <typename T> using vec = vector<T>;
template <typename T> using heap = priority_queue<T, vec<T>, greater<T>>;
#define times(n, i) for (i32 i = 0; i < (n); ++i)
#define range(n, m, i) for (i32 i = (n); i < (m); ++i)
#define upto(n, m, i) for (i32 i = (n); i <= (m); ++i)
#define downto(n, m, i) for (i32 i = (n); i >= (m); --i)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) (*max_element(all(xs)))
#define minimum(xs) (*min_element(all(xs)))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

str s;
vec<str> c;
i32 m;

bool check(i32 i, str x) {
    if (i + x.size() > s.size())
        return false;
    times(x.size(), j) {
        if (s[i+j] != x[j])
            return false;
    }
    return true;
}

i32 main()
{
    cin >> s >> m;
    c.resize(m);
    times(m, i) {
        cin >> c[i];
    }
    sortall(c);

    i64 ans = 0;
    times(s.size(), i) {
        upto(1, min(10, (i32)s.size()-i), l) {
            str sub = s.substr(i, l);
            if (binary_search(all(c), sub)) {
                ans++;
            }
        }
    }

    cout << ans << endl;
    return 0;
}