#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	char S[50001];
	while(~scanf("%s", S)) {
		int N = (int)strlen(S);
		const int MaxLen = 10;
		map<string, int> counts;
		rer(len, 1, MaxLen)
			rer(i, 0, N - len)
				++ counts[string(S + i, S + i + len)];
		int M;
		scanf("%d", &M);
		int ans = 0;
		rep(i, M) {
			char C[11];
			scanf("%s", C);
			ans += counts[C];
		}
		printf("%d\n", ans);
	}
	return 0;
}