#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int suf[200020], r[200020], r_mem[200020];
int n;
string s;
int k;
bool suf_sort(int i, int j) {
	int i1, i2, j1, j2;
	i1 = r[i];
	if (i + k > n)i2 = -1;
	else i2 = r[i + k];
	j1 = r[j];
	if (j + k > n)j2 = -1;
	else j2 = r[j + k];
	if (make_pair(i1, i2) < make_pair(j1, j2))return true;
	else return false;
}
void c_suf() {
	for (int i = 0; i <= n; i++) {
		suf[i] = i;
		if (i == n)r[i] = -1;
		else r[i] = s[i] - 'A';
	}
	for (k = 1; k <= n; k *= 2) {
		sort(suf, suf + n + 1, suf_sort);
		r_mem[suf[0]] = 0;
		for (int j = 1; j <= n; j++) {
			r_mem[suf[j]] = r_mem[suf[j - 1]];
			if (suf_sort(suf[j - 1], suf[j]))r_mem[suf[j]]++;
		}
		for (int j = 0; j <= n; j++) {
			r[j] = r_mem[j];
		}
	}
}
int suf_check(string cs) {
	int l = 0, r = n + 1;
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (cs > s.substr(suf[mid], n - suf[mid]))l = mid;
		else r = mid;
	}
	return r;
}
int main() {
	cin >> s;
	n = s.size();
	c_suf();
	int m;
	cin >> m;
	int ans = 0;
	for (int i = 0; i < m; i++) {
		string c;
		cin >> c;
		ans += suf_check(c + '{') - suf_check(c);
	}
	cout << ans << endl;
}