//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}



//head

string s;
int m;
map<ll, int> mp[10];
ll U[11];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> s >> m;
  U[0] = 1;
  rep(i, 10) {
    U[i+1] = U[i]*26;
  }
  rep(i, min(10, (int)s.size())) {
    ll hash_N = 0;
    rep(j, i) {
      hash_N += U[i-j] * (s[j]-'A');
    }
    rep(j, s.size()-i) {
      if(j) {
        hash_N *= 26;
        hash_N -= U[i+1] * (s[j-1]-'A');
      }
      hash_N += s[j+i]-'A';
      mp[i][hash_N]++;
    }
  }
  //cout << U[10] << endl;
  int res = 0;
  rep(i, m) {
    cin >> s;
    ll hh = 0;
    rep(i, s.size()) {
      hh += U[s.size()-i-1] * (s[i]-'A');
    }
    //cout << hh << endl;
    res += mp[s.size()-1][hh];
  }
  cout << res << endl;
}