#include <bits/stdc++.h>
using namespace std;
const int MAXN = 6e5 + 5;
struct SAM {
  int Len, Pre, Go[27];
} A[MAXN * 2];
char S[MAXN];
int N, Last, Root, tot, L[15], R[15], Ord[MAXN * 2], F[MAXN * 2][15];
void Add(int ch, int Ord) {
  int np = ++tot, p = Last;
  A[np].Len = A[p].Len + 1;
  if (Ord != -1) F[np][Ord]++;
  for (; p && !A[p].Go[ch]; p = A[p].Pre) A[p].Go[ch] = np;
  if (!p)
    A[np].Pre = Root;
  else {
    int q = A[p].Go[ch];
    if (A[q].Len == A[p].Len + 1)
      A[np].Pre = q;
    else {
      int nq = ++tot;
      A[nq] = A[q];
      A[nq].Len = A[p].Len + 1;
      A[np].Pre = A[q].Pre = nq;
      for (; p && A[p].Go[ch] == q; p = A[p].Pre) A[p].Go[ch] = nq;
    }
  }
  Last = np;
}
void Sort() {
  static int tax[MAXN];
  memset(tax, 0, sizeof tax);
  for (int i = 1; i <= tot; i++) tax[A[i].Len]++;
  for (int i = 1; i < MAXN; i++) tax[i] += tax[i - 1];
  for (int i = tot; i; i--) Ord[tax[A[i].Len]--] = i;
}
void Solve() {
  int Ans = 0;
  for (int i = tot; i; i--) {
    int Now = Ord[i];
    for (int j = 0; j <= N; j++) F[A[Now].Pre][j] += F[Now][j];
    if (!F[Now][0]) continue;
    bool Flag = 1;
    for (int j = 1; j <= N; j++)
      if (F[Now][j] < L[j] || F[Now][j] > R[j]) Flag = 0;
    if (Flag) Ans += A[Now].Len - A[A[Now].Pre].Len;
  }
  printf("%d\n", Ans);
}
int main() {
  scanf("%s", S + 1);
  Root = tot = Last = 1;
  for (int i = 1; i <= strlen(S + 1); i++) Add(S[i] - 'a', 0);
  Add(26, -1);
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%s%d%d\n", S + 1, &L[i], &R[i]);
    for (int j = 1; j <= strlen(S + 1); j++) Add(S[j] - 'a', i);
    Add(26, -1);
  }
  Sort();
  Solve();
}

### 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 int MAXN = 6e5 + 5;
struct SAM {
  int Len, Pre, Go[27];
} A[MAXN * 2];
char S[MAXN];
int N, Last, Root, tot, L[15], R[15], Ord[MAXN * 2], F[MAXN * 2][15];
void Add(int ch, int Ord) {
  int np = ++tot, p = Last;
  A[np].Len = A[p].Len + 1;
  if (Ord != -1) F[np][Ord]++;
  for (; p && !A[p].Go[ch]; p = A[p].Pre) A[p].Go[ch] = np;
  if (!p)
    A[np].Pre = Root;
  else {
    int q = A[p].Go[ch];
    if (A[q].Len == A[p].Len + 1)
      A[np].Pre = q;
    else {
      int nq = ++tot;
      A[nq] = A[q];
      A[nq].Len = A[p].Len + 1;
      A[np].Pre = A[q].Pre = nq;
      for (; p && A[p].Go[ch] == q; p = A[p].Pre) A[p].Go[ch] = nq;
    }
  }
  Last = np;
}
void Sort() {
  static int tax[MAXN];
  memset(tax, 0, sizeof tax);
  for (int i = 1; i <= tot; i++) tax[A[i].Len]++;
  for (int i = 1; i < MAXN; i++) tax[i] += tax[i - 1];
  for (int i = tot; i; i--) Ord[tax[A[i].Len]--] = i;
}
void Solve() {
  int Ans = 0;
  for (int i = tot; i; i--) {
    int Now = Ord[i];
    for (int j = 0; j <= N; j++) F[A[Now].Pre][j] += F[Now][j];
    if (!F[Now][0]) continue;
    bool Flag = 1;
    for (int j = 1; j <= N; j++)
      if (F[Now][j] < L[j] || F[Now][j] > R[j]) Flag = 0;
    if (Flag) Ans += A[Now].Len - A[A[Now].Pre].Len;
  }
  printf("%d\n", Ans);
}
int main() {
  scanf("%s", S + 1);
  Root = tot = Last = 1;
  for (int i = 1; i <= strlen(S + 1); i++) Add(S[i] - 'a', 0);
  Add(26, -1);
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%s%d%d\n", S + 1, &L[i], &R[i]);
    for (int j = 1; j <= strlen(S + 1); j++) Add(S[j] - 'a', i);
    Add(26, -1);
  }
  Sort();
  Solve();
}

```