Problem: Katya recently started to invent programming tasks and prepare her own contests. What she does not like is boring and simple constraints. Katya is fed up with all those "N does not exceed a thousand" and "the sum of ai does not exceed a million" and she decided to come up with something a little more complicated.

The last problem written by Katya deals with strings. The input is a string of small Latin letters. To make the statement longer and strike terror into the people who will solve the contest, Katya came up with the following set of k restrictions of the same type (characters in restrictions can be repeated and some restrictions may contradict each other): 

  * The number of characters c1 in a string is not less than l1 and not more than r1. 
  * ... 
  * The number of characters ci in a string is not less than li and not more than ri. 
  * ... 
  * The number of characters ck in a string is not less than lk and not more than rk. 



However, having decided that it is too simple and obvious, Katya added the following condition: a string meets no less than L and not more than R constraints from the above given list.

Katya does not like to compose difficult and mean tests, so she just took a big string s and wants to add to the tests all its substrings that meet the constraints. However, Katya got lost in her conditions and asked you to count the number of substrings of the string s that meet the conditions (each occurrence of the substring is counted separately).

Input

The first line contains a non-empty string s, consisting of small Latin letters. The length of the string s does not exceed 105.

The second line contains three space-separated integers k, L and R (0 ≤ L ≤ R ≤ k ≤ 500).

Next k lines contain Katya's constrictions in the following form "ci li ri". All letters ci are small Latin letters, li and ri are integers (0 ≤ li ≤ ri ≤ |s|, where |s| is the length of string s). Letters ci are not necessarily different.

Output

Print a single number — the number of substrings that meet the constrictions.

Please do not use the %lld specificator to read or write 64-bit integers in С++. It is preferred to use the cout stream or the %I64d specificator.

Examples

Input

codeforces
2 0 0
o 1 2
e 1 2


Output

7


Input

codeforces
2 1 1
o 1 2
o 1 2


Output

0

Note

In the first test we should count the number of strings that do not contain characters "e" and "o". All such strings are as follows (in the order of occurrence in the initial string from the left to the right): "c", "d"', "f", "r", "rc", "c", "s".

In the second test we cannot achieve fulfilling exactly one of the two identical constrictions, so the answer is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
const int K = 500;
const int NN = N + 13;
const int KK = K + 13;
int n;
char s[NN];
int k, L, R;
int cs[KK], lfs[KK], rgs[KK];
vector<int> occ[26 + 3];
int cntGood, okRules[N];
int ptr[26];
void dec(char c, int rg) {
  if (ptr[int(c)] < rg) return;
  int lfidx = (ptr[int(c)] - rg - 1 >= 0 ? occ[c][ptr[int(c)] - rg - 1] : -1);
  int rgidx = occ[c][ptr[int(c)] - rg] - (rg == 0);
  for (int i = lfidx + 1; i <= rgidx; i++) {
    okRules[i]--;
    if (okRules[i] == R)
      cntGood++;
    else if (okRules[i] == L - 1)
      cntGood--;
  }
}
void inc(char c, int lf) {
  if (lf == 0) return;
  if (ptr[int(c)] + 1 < lf) return;
  int lfidx = (ptr[int(c)] - lf >= 0 ? occ[c][ptr[int(c)] - lf] : -1);
  int rgidx = occ[c][ptr[int(c)] - lf + 1] - (lf == 1);
  for (int i = lfidx + 1; i <= rgidx; i++) {
    okRules[i]++;
    if (okRules[i] == L)
      cntGood++;
    else if (okRules[i] == R + 1)
      cntGood--;
  }
}
void solve() {
  char tt[10];
  scanf("%s", s);
  n = strlen(s);
  assert(0 < n && n <= N);
  int i, j;
  for (i = 0; i < n; i++) {
    assert(islower(s[i]));
    s[i] -= 'a';
  }
  for (i = 0; i < n; i++) occ[int(s[i])].push_back(i);
  scanf("%d%d%d", &k, &L, &R);
  assert(0 <= L && L <= R && R <= k && k <= K);
  for (i = 0; i < k; i++) {
    scanf("%s", tt);
    cs[i] = tt[0];
    scanf("%d%d", &lfs[i], &rgs[i]);
    assert(islower(cs[i]));
    assert(0 <= lfs[i] && lfs[i] <= rgs[i] && rgs[i] <= n);
    cs[i] -= 'a';
  }
  long long ans = 0;
  memset(ptr, -1, sizeof(ptr));
  for (i = 0; i < n; i++) {
    char curc = s[i];
    ptr[int(curc)]++;
    for (j = 0; j < k; j++)
      if ((curc == cs[j] && lfs[j] <= 1 && 1 <= rgs[j]) ||
          (curc != cs[j] && lfs[j] == 0))
        okRules[i]++;
    if (L <= okRules[i] && okRules[i] <= R) cntGood++;
    for (j = 0; j < k; j++) {
      if (curc != cs[j]) continue;
      inc(curc, lfs[j]);
      dec(curc, rgs[j]);
    }
    ans += cntGood;
  }
  printf("%lld\n", ans);
}
int main() {
  solve();
  return 0;
}