#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

int main(){
    CININIT;
    string s;cin>>s;
    int M;cin>>M;
    ll ans=0;
    vector<int> mp[26];
    rep(i,s.size())
        mp[s[i]-'A'].push_back(i);

    for(int i=0;i<M;++i){
        string c;cin>>c;
        if(c.size()==1){
            ans += mp[c[0]-'A'].size();
            continue;
        }
        for(int idx : mp[c[0]-'A']){
            if(s.substr(idx,c.size())==c) ans++;
        }
    }
    cout << ans << endl;
}