#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
#endif
using ll = long long;
using ld = long double;
const ll INF = 1ll<<60;
const ld EPS = 1.0/1e9;
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define del(x) sort(all(x)); x.erase(unique(all(x)),x.end());

struct rolling_hash{
  string s;
  int n;
  const vector<long long>mods={999999937ll, 1000000007ll};
  long long base;
  vector<long long>hashs[2];
  vector<long long>pows[2];
  rolling_hash(string const &t,long long b=10007):s(t),base(b){
    for(int i=0;i<2;i++){
      n=s.size();
      hashs[i].assign(n+1,0ll); pows[i].assign(n+1,1);
      for(int j=0;j<n;j++){
        hashs[i][j+1]+=(hashs[i][j]*base+s[j])%mods[i];
        pows[i][j+1]=(pows[i][j]*base)%mods[i];
      }
    }
  }
  inline long long get(int l,int r,int id=0){
    long long res=hashs[id][r] - hashs[id][l]*pows[id][r-l]%mods[id];
    if(res<0) res+=mods[id];
    return res;
  }
};

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string s; cin >> s;
  ll m; cin >> m;
  ll n=s.size();
  rolling_hash h(s,26ll);
  map<ll,int>cnt;
  rep(i,0,n){
    rep(j,i,min(i+10ll,n)){
      cnt[h.get(i,j+1)]++;
    }
  }
  ll ans=0;
  rep(i,0,m){
    string t; cin >> t;
    rolling_hash x(t,26);
    if(cnt.count(x.get(0,t.size()))) ans += cnt[x.get(0,t.size())];
  }
  cout << ans << endl;
}