#include<stdio.h>
int n;
int sum[500005];
int f(int ind, int len)
{
	int min, mid, max;
	min = ind;
	max = n;
	while (max - min > 1)
	{
		mid = (max + min) / 2;
		if (sum[mid] - sum[ind] < len)
			min = mid;
		else
			max = mid;
	}
	return max;
}
int main()
{
	scanf("%d", &n);
	int a, b, c;
	scanf("%d %d %d", &a, &b, &c);
	int i, j, k, l;
	char s[500005][16];
	for (i = 0; i < n; i++)
		scanf("%s", s[i]);
	sum[0] = 0;
	for (i = 0; i < n; i++)
	{
		for (j = 0; s[i][j] != '\0'; j++);
		sum[i + 1] = sum[i] + j;
	}
	int ans = 0;
	for (i = 0; i < n; i++)
	{
		j = f(i, a);
		k = f(j, b);
		l = f(k, c);
		if (sum[j] - sum[i] == a && sum[k] - sum[j] == b && sum[l] - sum[k] == c)
			ans++;
	}
	printf("%d\n", ans);
	return 0;
}