#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <random>

#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a)-1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a)-1; (i) >= (b); (i)--)
#define PI acos(-1.0)
#define DEBUG(C) cerr << C << endl;
#define VI vector <int>
#define VII vector <VI>
#define VL vector <LL>
#define VLL vector <VL>
#define VD vector <double>
#define VDD vector <VD>
#define PII pair <int, int>
#define PDD pair <double, double>
#define PLL pair <LL, LL>
#define VPII vector <PII>
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EB emplace_back
#define FORE(a, b) for (auto &&a:b)
#define FIND(s, n) (s.find(n) != s.end())

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

template<typename T = int>
class Trie {
private:
    struct Node {
        Node *nxt[26];
        T w = 0;
    };
    Node root;
public:
    Trie() {
        root = Node();
        for (int i = 0; i < 26; i++) {
            root.nxt[i] = nullptr;
        }
    }
    void insert(const string& str, T w = 1) {
        Node *now;
        now = &this->root;
        for (const char c : str) {
            if (now->nxt[c - 'A'] == nullptr) {
                now->nxt[c - 'A'] = new Node();
            }
            now = now->nxt[c - 'A'];
        }
        now->w = w;
    }
    void make(const vector <pair<string, T>>& v) {
        for (pair<string, T> &&p : v) {
            inesrt(p.first, p.second);
        }
    }
    int search(const string& str) {
        Node *now;
        now = &this->root;
        for (const char c : str) {
            if (now->nxt[c - 'A'] == nullptr) return 0;
            now = now->nxt[c - 'A'];
        }
        return now->w;
    }
};

char buf[50010];
int main(void) {
    Trie <int> t;
    scanf("%s", buf);
    string S = buf;
    int M; scanf("%d", &M);
    REP(i, M) {
        scanf("%s", buf);
        string s = buf;
        t.insert(s);
    }
    int ans = 0;
    REP(i, 10) {
        REP(j, (int)S.length() - i) {
            ans += t.search(S.substr(j, i + 1));
        }
    }
    cout << ans << endl;
    return 0;
}