#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, a, b, c;
  cin >> n >> a >> b >> c;
  vector<int> sum(n + 1, 0);
  rep(i, n) {
    string s;
    cin >> s;
    sum[i + 1] = sum[i] + s.size();
  }
  int ans = 0;
  rep(i, n) {
    int j = lower_bound(sum.begin(), sum.end(), sum[i] + a) - sum.begin();
    if (j == n + 1 || sum[j] != sum[i] + a) continue;
    int k = lower_bound(sum.begin(), sum.end(), sum[j] + b) - sum.begin();
    if (k == n + 1 || sum[k] != sum[j] + b) continue;
    if (binary_search(sum.begin(), sum.end(), sum[k] + c)) ++ans;
  }
  cout << ans << '\n';
  return 0;
}