#include "bits/stdc++.h"
#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = (1LL << 61);
ll mod = 998244353;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int N; cin >> N;
	int a, b, c; cin >> a >> b >> c;
	vector<int>A(N);
	for (int i = 0; i < N; i++) {
		string S; cin >> S;
		A[i] = (int)S.size();
	}
	vector<int>sum(N + 1);
	for (int i = 0; i < N; i++) {
		sum[i + 1] = sum[i] + A[i];
	}
	map<int, int>mp, mp2;
	for (int i = 0; i <= N; i++) {
		mp2[sum[i] - c]++;
	}
	mp[sum[0] + a]++;
	int ans = 0;
	for (int i = 0; i < N; i++) {
		mp2[sum[i] - c]--;
		int idx = lower_bound(sum.begin(), sum.end(), sum[i + 1] + b) - sum.begin();
		if (idx <= N && sum[idx] - sum[i + 1] == b) {
			ans += mp[sum[i + 1]] * mp2[sum[idx]];
			
		}
		mp[sum[i + 1] + a]++;
	}
	cout << ans << endl;

	return 0;

}