#include <cassert>
#include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
using u64 = uint64_t;

u64 uz = time(NULL);
inline u64 xorshift64() {
  uz ^= uz << 18;
  uz ^= uz >> 19;
  uz ^= uz << 19;
  return uz;
}

class rolling_hash {
  static constexpr u64 M = (1ULL << 63) - (1ULL << 41) + 1;

  // fxt-2018.07.03.tar.gz
  static constexpr u64 mod_mul(u64 a, u64 b) {
    u64 r = a * b - M * static_cast<u64>( static_cast<long double>(a) * static_cast<long double>(b)/M + static_cast<long double>(1)/2 );
    if(int64_t(r) < 0) { r += M; }
    return r;
  }

  string s;
  size_t n;
  u64 b61;
  vector<u64> B, H;
 public:
  rolling_hash() {}
  explicit rolling_hash(const string &_s, u64 seed=xorshift64()) : s(_s), b61(seed % (M-128) + 127), n(s.size()) {
    B.resize(n+1);
    H.resize(n+1);
    B[0] = 1;
    for(size_t i=0; i<n; ++i) {
      B[i+1] = mod_mul(B[i], b61);
      H[i+1] = mod_mul(H[i], b61) + s[i];
      if(H[i+1] >= M) { H[i+1] -= M; }
    }
  }
  u64 calc_hash(size_t l, size_t r) const {    // [l, r]. つまり l も r も含む。1-indexed.
    assert(l <= r);
    assert(l <= n && r <= n); // if(l > n || r > n) { return -1; }
    return calc_hash2(l, r-l+1);
  }
  u64 calc_hash2(size_t l, size_t len) const { // l から len 文字。1-indexed.
    assert(1 <= len);
    assert(l <= n && l+len <= n+1);
    u64 x = H[l+len-1], yz = mod_mul(B[len], H[l-1]);
    return x < yz ? M - yz + x : x - yz;
  }
};

int main(void) {
  cin.tie(nullptr); ios::sync_with_stdio(false);
  string s; int m; cin >> s >> m;
  u64 seed = xorshift64();
  rolling_hash rh(s, seed);
  unordered_map<u64, int> mp;
  for(size_t i=1, n=s.size(); i<=n; ++i) {
    for(size_t len=1; len<=10 && i+len<=n+1; ++len) {
      ++mp[rh.calc_hash2(i, len)];
    }
  }
  int res = 0;
  for(int i=0; i<m; ++i) {
    string ci; cin >> ci;
    rolling_hash rh2(ci, seed);
    res += mp[rh2.calc_hash(1, ci.size())];
  }
  cout << res << '\n';
  return 0;
}