#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./CompetitiveProgrammingCpp/Timer.hpp"
#include "./CompetitiveProgrammingCpp/debug.hpp"
#include "./CompetitiveProgrammingCpp/sample.hpp"
#else
#define dump(...)
template <class T>
inline auto d_val(T a, T b) {
  return a;
}
#endif

/* (=＾o＾=) */
#define int ll

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto& x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto&
/* macro func */
template <class T>
inline auto sort(T& t) {
  std::sort(ALL(t));
}
template <class T>
inline auto rsort(T& t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T>
inline auto unique(T& t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S>
inline auto chmax(T& t, const S& s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S>
inline auto chmin(T& t, const S& s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <>
class hash<std::pair<ll, ll>> {
 public:
  size_t operator()(const std::pair<ll, ll>& x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
}  // namespace std

/* input */
template <class T>
std::istream& operator>>(std::istream& is, vector<T>& vec) {
  for (T& x : vec) is >> x;
  return is;
}

//=============================================================================================

constexpr auto nullLambda = [](ll n) {};
template <class Val = bool, Val ignore = false>
class TrieTree {
  Val m_val;
  std::vector<std::unique_ptr<TrieTree>> m_next;
  // static constexpr auto nullLambda = [](ll n) {}; c++17

  auto emplace(const std::vector<int>& vec, Val val, int it) {
    if (it == vec.size()) {
      m_val = val;
      return;
    }
    if (!m_next[vec[it]]) {
      m_next[vec[it]] = std::make_unique<TrieTree>();
    }
    m_next[vec[it]]->emplace(vec, val, it + 1);
  }

  template <class Lambda>
  auto find(const std::vector<int>& vec, int it, const Lambda& lambda) const {
    if (m_val != ignore) {
      lambda(m_val);
    }
    if (it == vec.size()) {
      return m_val;
    }
    if (!m_next[vec[it]]) {
      return ignore;
    }
    return m_next[vec[it]]->find(vec, it + 1, lambda);
  }

 public:
  TrieTree() : TrieTree(ignore) {}
  TrieTree(Val val)
      : m_val(val), m_next(std::vector<std::unique_ptr<TrieTree>>(26)) {}

  auto emplace(const std::vector<int>& vec, Val val) {
    return emplace(vec, val, 0);
  }

  template <class Lambda = decltype(nullLambda)>
  auto find(const std::vector<int>& vec, const Lambda& lambda = nullLambda) {
    return find(vec, 0, lambda);
  }
};

signed main() {
  string str;
  cin >> str;
  ll n;
  cin >> n;

  auto tree = TrieTree<bool, false>();
  REP(_, n) {
    string s;
    cin >> s;
    VL v;
    v.reserve(s.size());
    REPC(c, s) { v.emplace_back(c - 'A'); }
    tree.emplace(v, true);
  }

  ll sz = str.size();
  ll ans = 0;
  REP(i, sz) {
    VL v;
    v.reserve(10);
    FOR(j, i, std::min(i + 10, sz)) { v.emplace_back(str[j] - 'A'); }
    auto update = [&](bool b) { ++ans; };
    tree.find(v, update);
  }
  cout << ans << endl;
}