#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
#include <iomanip>

using namespace std;

#define int long long

#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define omajinai ios::sync_with_stdio(false);cin.tie(0)
#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define rep1(i,x) for(int i=1;i<=(int)(x);++i)

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T>T& max(T&a,T&b){if(a>=b)return a;return b;}
template<typename T>T& min(T&a,T&b){if(a<b)return a;return b;}
template<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<typename T>T get(){T a;cin>>a;return a;}
template<typename T>T rev(T a){reverse(all(a));return a;}
template<typename T>vector<T>&sort(vector<T>&a){sort(all(a));return a;}

const int inf = 1e9;
const ll linf = 3e18;
const double eps = 1e-9;

const int mod = 1e9 + 9;

vi primes;

bool is_prime(int n)
{
    for (int i = 2; i * i <= n; ++i) if (n % i == 0) return false;
    return true;
}

int myhash[11][50001]; // i := 長さ, j := 終端位置

map<string, int> m;

signed main()
{ // #define int long long をしてるのでscanfを使うと意味不明な値が入力され死にます
    string S; cin >> S;

    for (int i = 1; i <= 10; ++i) {
        for (int j = 0; j + i <= S.size(); ++j) {
            m[S.substr(j, i)] += 1;
        }
    }

    int sum=0;

    int M; cin >> M;
    rep(i, M) {
        string C; cin >> C;
        sum += m[C];
    }

    cout << sum << endl;
}