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

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

struct RollingHash{
  const LL B1, B2, M1, M2;
  vector<LL> hash1, hash2, pow1, pow2;
  RollingHash(const string& str): B1(1007), B2(1009), M1(1000000007), M2(1000000009){
	int N = str.size();
	hash1.assign(N+1,0);
	hash2.assign(N+1,0);
	pow1.assign(N+1,1);
	pow2.assign(N+1,1);

	for(int i=0;i<N;++i){
	  hash1[i+1] = (hash1[i] * B1 + str[i]) % M1;
	  hash2[i+1] = (hash2[i] * B2 + str[i]) % M2;
	  pow1[i+1] = pow1[i] * B1 % M1;
	  pow2[i+1] = pow2[i] * B2 % M2;
	}
  }

  // [l,r), 0 <= l < r <= n
  pair<LL,LL> hash(int l, int r){
	pair<LL,LL> res;
	res.first = ((hash1[r] - hash1[l] * pow1[r-l]) % M1 + M1) % M1;
	res.second = ((hash2[r] - hash2[l] * pow2[r-l]) % M2 + M2) % M2;
	return res;
  }
};

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  string S;
  cin >> S;
  RollingHash rs(S);
  int M;
  cin >> M;
  vector<map<PLL,int>> cnt(11);
  REP(i,M){
	string T;
	cin >> T;
	cnt[SZ(T)][RollingHash(T).hash(0, SZ(T))]++;
  }
  
  int ans = 0;
  FOR(len,1,11){
	for(int i=0;i+len<=SZ(S);++i)
	  ans += cnt[len][rs.hash(i,i+len)];
  }
  cout << ans << endl;

  return 0;
}