#line 1 "test/yuki_0430.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/430"

#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif

#line 2 "string/rolling_hash.cpp"

#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif

#line 2 "math/montgomery.cpp"

#ifndef call_include
#define call_include
#include <bits/stdc++.h>
using namespace std;
#endif

struct Montgomery {
	const long long P;
	const int R_bit = 32;
	const long long R = (1ll << R_bit);
	const long long R2;
	long long P2 = 0;
	const long long mask = (1ll << R_bit) - 1;

	Montgomery(const long long mod) : P(mod), R2(R % P * R % P) {
		long long t = 0, vi = 1;
		int ni = R_bit;
		while(ni--) {
			if((t & 1) == 0) {
				t += P;
				P2 += vi;
			}
			t >>= 1;
			vi <<= 1;
		}
	}

	long long reduction(long long x) {
		unsigned long long ret = x * P2;
		ret &= mask;
		ret *= P;
		ret += x;
		ret >>= R_bit;
		if(ret >= P) ret -= P;
		return ret;
	}

	long long conv_mg(long long x) {
		return reduction(x * R2);
	}

	long long mul(long long a, long long b) {
		return reduction(reduction(a * b) * R2);
	}
};
#line 10 "string/rolling_hash.cpp"

struct RollingHash {
private:
	const int N;
	const long long MOD1 = 1000000007;
	const long long MOD2 = 1992732529;
	Montgomery mg1 = Montgomery(MOD1);
	Montgomery mg2 = Montgomery(MOD2);
	long long base1, base2, base1_mg, base2_mg;
	vector<long long> hash1, hash2, pw1, pw2;

public:
	RollingHash(string &s) :
		N(s.size()),
		hash1(N + 1, 0),
		hash2(N + 1, 0),
		pw1(N + 1, mg1.conv_mg(1)),
		pw2(N + 1, mg2.conv_mg(1)) {
		random_device rd;
		mt19937 mt(rd());
		uniform_int_distribution<long long> dist1(257, MOD1 - 2);
		uniform_int_distribution<long long> dist2(257, MOD2 - 2);
		base1 = dist1(mt);
		base2 = dist2(mt);
		base1_mg = mg1.conv_mg(base1);
		base2_mg = mg2.conv_mg(base2);

		for(int i = 0; i < N; i++) {
			pw1[i + 1] = mg1.reduction(pw1[i] * base1_mg);
			pw2[i + 1] = mg2.reduction(pw2[i] * base2_mg);
			hash1[i + 1] = mg1.reduction(hash1[i] * base1_mg) + int(s[i]);
			hash2[i + 1] = mg2.reduction(hash2[i] * base2_mg) + int(s[i]);
			if(hash1[i + 1] >= MOD1) hash1[i + 1] -= MOD1;
			if(hash2[i + 1] >= MOD2) hash2[i + 1] -= MOD2;
		}
	}

	pair<long long, long long> get(int l, int r) {
		assert(l <= r);
		assert(0 <= l and r <= N);
		long long h1 = hash1[r] - mg1.reduction(hash1[l] * pw1[r - l]);
		long long h2 = hash2[r] - mg2.reduction(hash2[l] * pw2[r - l]);
		if(h1 < 0) h1 += MOD1;
		if(h2 < 0) h2 += MOD2;
		return pair(h1, h2);
	}

	vector<int> iscontain(string &t) {
		const int M = t.size();
		if(N < M) return {};

		vector<int> ret;
		long long h1_t = 0, h2_t = 0;
		for(int i = 0; i < M; i++) {
			h1_t = mg1.reduction(h1_t * base1_mg) + int(t[i]);
			h2_t = mg2.reduction(h2_t * base2_mg) + int(t[i]);
			if(h1_t >= MOD1) h1_t -= MOD1;
			if(h2_t >= MOD2) h2_t -= MOD2;
		}

		for(int i = 0; i + M <= N; i++) {
			pair<long long, long long> p = get(i, i + M);
			if(p.first == h1_t and p.second == h2_t) ret.emplace_back(i);
		}

		return ret;
	}
};
#line 10 "test/yuki_0430.test.cpp"

int main() {
	string S;
	int M;
	vector<string> C;

	cin >> S >> M;
	C.resize(M);
	for(int i = 0; i < M; i++) cin >> C[i];

	RollingHash rh(S);
	long long ans = 0;
	for(int i = 0; i < M; i++) {
		ans += rh.iscontain(C[i]).size();
	}

	cout << ans << endl;
}