//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cstdint>
#include <stack>

#define rep(i,n) for(int i = 0; i < (n); i++) //[0,n)
#define srep(i,a,b) for(int i = (a); i < (b); i++) //[a,b)
#define all(A) (A).begin(),(A).end()
#define rall(A) (A).rbegin(),(A).rend()
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll inf = 1LL<<60;
const int iinf = (int)1e9+1;
const int mod9 = 998244353;
const int mod1 = (int)1e9+7;
struct Edge { int to; long long cost; int from; int i; };
bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; }
using Graph = vector<vector<int>>;
using EGraph = vector<Edge>;
using SGraph = vector<vector<ll>>;
template <class T>
int siz(T& a){return (int)a.size();}
double square(double a){ return 1.0*a*a; }
double torad(double x){ return x*(acos(-1)/180.0); }
ll cross(ll ax,ll ay,ll bx,ll by){ return ax*by-ay*bx; }
ll mceil(ll a,ll b){ return (a+b-1)/b; }

struct RollingHash {
    const int base = 1007;
    const int base2 = 2009;

    const int mod = (int)1e9+7;
    const int mod2 = (int)1e9+9;

    vector<ll> hash,pow,hash2,pow2;
    
    RollingHash(string &S){
        int n = siz(S);
        hash.assign(n+1,0); pow.assign(n+1,1);
        hash2.assign(n+1,0); pow2.assign(n+1,1);

        rep(i,n) (pow[i+1] = 1LL*base*pow[i]) %= mod;
        rep(i,n) (hash[i+1] = S[i]+hash[i]*base%mod);
        
        rep(i,n) (pow2[i+1] = 1LL*base2*pow2[i]) %= mod2;
        rep(i,n) (hash2[i+1] = S[i]+hash2[i]*base2%mod2);
    }

    pair<ll,ll> get(int l,int r){
        ll val = hash[r]-hash[l]*pow[r-l]%mod;
        ll val2 = hash2[r]-hash2[l]*pow2[r-l]%mod2;

        if(val < 0) val += mod;
        if(val2 < 0) val2 += mod2;

        return {val,val2};
    }
};

int main(){
    string S; cin >> S;
    int N; cin >> N;
    
    RollingHash rh(S);
    map<pair<ll,ll>,int> mp;
    
    rep(i,siz(S)){
        srep(j,1,10+1){
            if(i+j > siz(S)) break;
            mp[rh.get(i,i+j)]++;
        }
    }

    int ans = 0;
    while(N--){
        string C; cin >> C;
        RollingHash crh(C);

        ans += mp[crh.get(0,siz(C))];
    }

    cout << ans;
}