#include <bits/stdc++.h>
using namespace std;
const unsigned long long x = 31;
unsigned long long X[60000];
int Ql[20], Qr[20];
char str[60000], s[60000];
int N;
map<unsigned long long, int> T[20];
map<unsigned long long, bool> A;
void add(int index, unsigned long long H) { T[index][H] = T[index][H] + 1; }
void CalcHashes(char s[], int index) {
  unsigned long long H;
  int i, j, L = strlen(s);
  for (i = 1; i <= L; i++) {
    H = 0;
    for (j = 0; j < i; j++) H += X[i - j - 1] * (s[j] - 'a' + 1);
    add(index, H);
    for (j = i; j < L; j++) {
      H = (H - X[i - 1] * (s[j - i] - 'a' + 1)) * x + (s[j] - 'a' + 1);
      add(index, H);
    }
  }
}
int answer;
void check(unsigned long long H) {
  if (A[H]) return;
  A[H] = true;
  int i, t;
  bool v = true;
  for (i = 0; i < N && v; i++) {
    t = T[i][H];
    if (t < Ql[i] || Qr[i] < t) v = false;
  }
  if (v) answer++;
}
int main() {
  unsigned long long H;
  int i, j, L;
  for (X[0] = 1, i = 1; i <= 60000; i++) X[i] = X[i - 1] * x;
  scanf("%s", str);
  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%s%d%d", &s, &Ql[i], &Qr[i]);
    CalcHashes(s, i);
  }
  L = strlen(str);
  for (i = 1; i <= L; i++) {
    H = 0;
    for (j = 0; j < i; j++) H += X[i - j - 1] * (str[j] - 'a' + 1);
    check(H);
    for (j = i; j < L; j++) {
      H = (H - X[i - 1] * (str[j - i] - 'a' + 1)) * x + (str[j] - 'a' + 1);
      check(H);
    }
  }
  printf("%d", answer);
  return 0;
}

### Prompt

Your task is to create a Cpp solution to the following problem:

Smart Beaver recently got interested in a new word game. The point is as follows: count the number of distinct good substrings of some string s. To determine if a string is good or not the game uses rules. Overall there are n rules. Each rule is described by a group of three (p, l, r), where p is a string and l and r (l ≤ r) are integers. We’ll say that string t complies with rule (p, l, r), if the number of occurrences of string t in string p lies between l and r, inclusive. For example, string "ab", complies with rules ("ab", 1, 2) and ("aab", 0, 1), but does not comply with rules ("cd", 1, 2) and ("abab", 0, 1).

A substring s[l... r] (1 ≤ l ≤ r ≤ |s|) of string s = s1s2... s|s| (|s| is a length of s) is string slsl + 1... sr.

Consider a number of occurrences  of string t in string p as a number of pairs of integers l, r (1 ≤ l ≤ r ≤ |p|) such that p[l... r] = t.

We’ll say that string t is good if it complies with all n rules. Smart Beaver asks you to help him to write a program that can calculate the number of distinct good substrings of string s. Two substrings s[x... y] and s[z... w] are cosidered to be distinct iff s[x... y] ≠ s[z... w].

Input

The first line contains string s. The second line contains integer n. Next n lines contain the rules, one per line. Each of these lines contains a string and two integers pi, li, ri, separated by single spaces (0 ≤ li ≤ ri ≤ |pi|). It is guaranteed that all the given strings are non-empty and only contain lowercase English letters.

The input limits for scoring 30 points are (subproblem G1): 

  * 0 ≤ n ≤ 10. 
  * The length of string s and the maximum length of string p is  ≤ 200. 



The input limits for scoring 70 points are (subproblems G1+G2): 

  * 0 ≤ n ≤ 10. 
  * The length of string s and the maximum length of string p is  ≤ 2000. 



The input limits for scoring 100 points are (subproblems G1+G2+G3): 

  * 0 ≤ n ≤ 10. 
  * The length of string s and the maximum length of string p is  ≤ 50000. 

Output

Print a single integer — the number of good substrings of string s.

Examples

Input

aaab
2
aa 0 0
aab 1 1


Output

3


Input

ltntlnen
3
n 0 0
ttlneenl 1 4
lelllt 1 1


Output

2


Input

a
0


Output

1

Note

There are three good substrings in the first sample test: «aab», «ab» and «b».

In the second test only substrings «e» and «t» are good.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const unsigned long long x = 31;
unsigned long long X[60000];
int Ql[20], Qr[20];
char str[60000], s[60000];
int N;
map<unsigned long long, int> T[20];
map<unsigned long long, bool> A;
void add(int index, unsigned long long H) { T[index][H] = T[index][H] + 1; }
void CalcHashes(char s[], int index) {
  unsigned long long H;
  int i, j, L = strlen(s);
  for (i = 1; i <= L; i++) {
    H = 0;
    for (j = 0; j < i; j++) H += X[i - j - 1] * (s[j] - 'a' + 1);
    add(index, H);
    for (j = i; j < L; j++) {
      H = (H - X[i - 1] * (s[j - i] - 'a' + 1)) * x + (s[j] - 'a' + 1);
      add(index, H);
    }
  }
}
int answer;
void check(unsigned long long H) {
  if (A[H]) return;
  A[H] = true;
  int i, t;
  bool v = true;
  for (i = 0; i < N && v; i++) {
    t = T[i][H];
    if (t < Ql[i] || Qr[i] < t) v = false;
  }
  if (v) answer++;
}
int main() {
  unsigned long long H;
  int i, j, L;
  for (X[0] = 1, i = 1; i <= 60000; i++) X[i] = X[i - 1] * x;
  scanf("%s", str);
  scanf("%d", &N);
  for (i = 0; i < N; i++) {
    scanf("%s%d%d", &s, &Ql[i], &Qr[i]);
    CalcHashes(s, i);
  }
  L = strlen(str);
  for (i = 1; i <= L; i++) {
    H = 0;
    for (j = 0; j < i; j++) H += X[i - j - 1] * (str[j] - 'a' + 1);
    check(H);
    for (j = i; j < L; j++) {
      H = (H - X[i - 1] * (str[j - i] - 'a' + 1)) * x + (str[j] - 'a' + 1);
      check(H);
    }
  }
  printf("%d", answer);
  return 0;
}

```