#include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define all(a)  (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }
template<class Type>struct is_vector : std::false_type {};
template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T> inline ostream& operator << (ostream& out, const vector<T>& v) {
	if (v.empty())return out;
	constexpr bool is_vector_v = is_vector<T>::value;
	if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
	else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");
	return out;
}
inline void put() {}
template<class T> inline void put(const T& first) { std::cout << first; printf("\n"); }
template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first; printf(" "); put(rest...); }
inline void putn() {}
template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first; printf("\n"); putn(rest...); }


template<typename T>
class RollingHash {
private:
	const T mod, base;
public:
	RollingHash(const T& mod, const T& base) :mod(mod), base(base) {}
	bool contain(const string& s, const string& t) {//sのsubstringにtが存在するか
		int sl = s.size(), tl = t.size();
		T sh = 0, th = 0, p = 1;
		if (sl < tl)return false;
		for (int i = 0; i < tl; ++i) {
			sh = sh * base + s[i];
			if (sh > mod)sh %= mod;
			th = th * base + t[i];
			if (th > mod)th %= mod;
			p *= base;
			if (p > mod)p %= mod;
		}
		if (th == sh)return true;
		for (int i = tl; i < sl; ++i) {
			sh = sh * base + s[i];
			if (sh < p * s[i - tl]) {
				sh += mod * s[i - tl];
			}
			sh -= p * s[i - tl];
			if (th > mod)sh %= mod;
			if (th == sh)return true;
		}
		return false;
	}
	vector<int> find(const string& s, const string& t) {//sのsubstringがtである先頭のindexを返す
		int sl = s.size(), tl = t.size();
		T sh = 0, th = 0, p = 1;
		vector<int> res;
		if (sl < tl)return res;
		for (int i = 0; i < tl; ++i) {
			sh = sh * base + s[i];
			if (sh > mod)sh %= mod;
			th = th * base + t[i];
			if (th > mod)th %= mod;
			p *= base;
			if (p > mod)p %= mod;
		}
		if (th == sh)res.push_back(0);
		for (int i = tl; i < sl; ++i) {
			sh = sh * base + s[i];
			if (sh < p * s[i - tl]) {
				sh += mod * s[i - tl];
			}
			sh -= p * s[i - tl];
			if (sh > mod)sh %= mod;
			if (th == sh)res.push_back(i - tl + 1);
		}
		return res;
	}
};

//#include <boost/multiprecision/cpp_int.hpp>

int main() {
	//namespace mp = boost::multiprecision;
	//using u128 = mp::uint128_t;
	int tmax = 252;
	random_device rnd;
	mt19937 mt(rnd());
	const ull mod = (ull)1e9 + 9;
	ull base = (ull)mt() % mod;
	if (base < tmax)base += tmax;
	using RH = RollingHash<ull>;
	RH r(mod, base);
	string s;
	int m;
	cin >> s >> m;
	ll res = 0;
	REP(i, m) {
		string c;
		cin >> c;
		res += r.find(s, c).size();
	}
	put(res);
	return 0;
}