#include <bits/stdc++.h>
using namespace std;

int n, m = 0;
string s;
long long a, b, c;

int main()
{
	cin >> n >> a >> b >> c;

	vector<long long> t(1, 0);

	for (int i = 0; i < n; i++) {
		cin >> s;
		t.push_back(t.back() + s.size());
	}

	t.push_back(1e18);

	for (int k = 1; k <= n; k++) {
		long long pa = *lower_bound(t.begin(), t.end(), t[k - 1] + a),
		pb = *lower_bound(t.begin(), t.end(), t[k - 1] + a + b),
		pc = *lower_bound(t.begin(), t.end(), t[k - 1] + a + b + c);

		if (pa - t[k - 1] == a && pb - t[k - 1] == a + b 
			&& pc - t[k - 1] == a + b + c) {
			m++;
		}
	}

	cout << m << endl;
}