#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
#ifdef LOCAL
#include "debug.h"
#include "esper.h"
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define esper(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<x<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout<<fixed<<setprecision(16);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cerr<<"time:";
  cerr<<(clock()-start)/1000;
  cerr<<"ms\n";
  #endif
}
template<int offset=0,int mx=26>
struct AhoCorasick{
  struct Node{
    int nxt[mx];
    int failure;
    Node(){
      rep(i,mx)nxt[i]=-1;
      failure=-1;
    }
    int& operator[](int i){return nxt[i];}
  };
  vector<Node>dat;
  AhoCorasick(){
    dat.push_back(Node());
  }
  int add(string s){
    int v=0;
    for(int c:s){
      c-=offset;
      if(dat[v][c]==-1){
        dat[v][c]=dat.size();
        dat.push_back(Node());
      }
      v=dat[v][c];
    }
    return v;
  }
  void build_aho(){
    int que[dat.size()];
    int l=0,r=1;
    que[0]=0;
    while(l<r){
      int x=que[l++];
      rep(i,mx){
        int s=dat[x][i];
        if(s==-1)continue;
        que[r++]=s;
        int f=dat[x].failure;
        while(f!=-1&&dat[f][i]==-1)f=dat[f].failure;
        dat[s].failure=f==-1?0:dat[f][i];
      }
    }
    rep(i,dat.size()){
      int s=que[i];
      rep(j,mx)if(dat[s][j]==-1){
        int f=dat[s].failure;
        dat[s][j]=f==-1?0:dat[f][j];
      }
    }
  }
};
void SOLVE(){
  string s;
  int n;
  cin>>s>>n;
  AhoCorasick<'A'>aho;
  vector<int>idx(n);
  rep(i,n){
    string t;
    cin>>t;
    idx[i]=aho.add(t);
  }
  aho.build_aho();
  vector<int>dp(aho.dat.size());
  int now=0;
  rep(i,s.size()){
    now=aho.dat[now][s[i]-'A'];
    dp[now]++;
  }
  vector<vector<int>>to(aho.dat.size());
  reps(i,1,aho.dat.size())to[aho.dat[i].failure].push_back(i);
  auto dfs=[&](auto self,int x)->void {
    for(auto i:to[x]){
      self(self,i);
      dp[x]+=dp[i];
    }
  };
  dfs(dfs,0);
  int ans=0;
  rep(i,n)ans+=dp[idx[i]];
  cout<<ans<<endl;
}