// yukicoder: No.430 文字列検索
// 2019.5.8 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()
{
	int n = 0, c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

int ins(char *s)
{
	char *p = s;
	do *s = gc();
	while (*s++ > ' ');
	*--s = 0;
	return s - p;
}

void out(int n)
{
	int i;
	char ob[20];

	if (!n) pc('0');
	else {
		i = 0; while (n) ob[i++] = n%10 + '0', n/=10;
		while (i--) pc(ob[i]);
	}
	pc('\n');
}

#define HASHSIZ 50021
long long hash[HASHSIZ+2], *hashend = hash+HASHSIZ;

void insert(char *s)
{
	long long i, *tp;

	i = 0; while (*s) i = (i<<5) + (*s++ -'A'+1);
	tp = hash + (int)(i % HASHSIZ);
	while (*tp) {
		if (*tp == i) return;
		if (++tp == hashend) tp = hash;
	}
	*tp = i;
}

long long mask[12];

int lookup(char *s, int max)
{
	int j, k;
	long long i, ii, *tp;
	int ans = 0;
	
	i = 0, j = 0;
	while (*s) {
		i = (i<<5) + (*s++ - 'A'+1);
		if (j < max) j++;
		for (k = 0; k < j; k++) {
			ii = i & mask[k];
			tp = hash + (int)(ii % HASHSIZ);
			while (*tp) {
				if (*tp == ii) { ans++; break; }
				if (++tp == hashend) tp = hash;
			}
		}
	}
	return ans;
}

char S[50005];

int main()
{
	int i, M, max;
	char C[12];

	ins(S);
	max = 0, M = in(); while (M--) {
		if ((i = ins(C)) > max) max = i;
		insert(C);
	}
	for (i = 1; i <= max; i++) mask[i-1] = (1LL << 5*i) - 1;
	out(lookup(S, max));
	return 0;
}