#include <bits/stdc++.h>
using namespace std;
struct Node {
  int ch[26], cnt[10], fail;
  Node() {
    memset(ch, 0, sizeof(ch));
    memset(cnt, 0, sizeof(cnt));
    fail = 0;
  }
} S[1001000];
int tot = 0;
inline void insert(Node *T, char *s, int &tot) {
  int u = 0, len = strlen(s);
  for (int i = 0; i < len; ++i) {
    int x = s[i] - 'a';
    if (!T[u].ch[x]) T[u].ch[x] = ++tot;
    u = T[u].ch[x];
  }
}
inline void Getfail(Node *T) {
  queue<int> Q;
  for (int i = 0; i < 26; ++i)
    if (T[0].ch[i]) Q.push(T[0].ch[i]);
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    for (int i = 0; i < 26; ++i)
      if (T[u].ch[i]) {
        int j = T[u].fail;
        while (j && !T[j].ch[i]) j = T[j].fail;
        T[T[u].ch[i]].fail = T[j].ch[i];
        Q.push(T[u].ch[i]);
      }
  }
}
inline void Query(Node *T, char *s, int f) {
  int u = 0, len = strlen(s);
  for (int i = 0; i < len; ++i) {
    int x = s[i] - 'a';
    while (u && !T[u].ch[x]) u = T[u].fail;
    if (T[u].ch[x]) {
      u = T[u].ch[x];
      int j = u;
      while (j) {
        T[j].cnt[f]++;
        j = T[j].fail;
      }
    }
  }
}
char s[50010], p[50010];
int n, L[10], R[10];
long long ans;
void dfs(Node *T, int u) {
  if (u) {
    int flag = 1;
    for (int i = 0; i < n; ++i)
      if (T[u].cnt[i] < L[i] || T[u].cnt[i] > R[i]) {
        flag = 0;
        break;
      }
    ans += flag;
  }
  for (int i = 0; i < 26; ++i)
    if (T[u].ch[i]) dfs(T, T[u].ch[i]);
}
int main() {
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i < len; ++i) insert(S, s + i, tot);
  Getfail(S);
  ans = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s%d%d", p, &L[i], &R[i]);
    Query(S, p, i);
  }
  dfs(S, 0);
  cout << ans << endl;
  return 0;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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;
struct Node {
  int ch[26], cnt[10], fail;
  Node() {
    memset(ch, 0, sizeof(ch));
    memset(cnt, 0, sizeof(cnt));
    fail = 0;
  }
} S[1001000];
int tot = 0;
inline void insert(Node *T, char *s, int &tot) {
  int u = 0, len = strlen(s);
  for (int i = 0; i < len; ++i) {
    int x = s[i] - 'a';
    if (!T[u].ch[x]) T[u].ch[x] = ++tot;
    u = T[u].ch[x];
  }
}
inline void Getfail(Node *T) {
  queue<int> Q;
  for (int i = 0; i < 26; ++i)
    if (T[0].ch[i]) Q.push(T[0].ch[i]);
  while (!Q.empty()) {
    int u = Q.front();
    Q.pop();
    for (int i = 0; i < 26; ++i)
      if (T[u].ch[i]) {
        int j = T[u].fail;
        while (j && !T[j].ch[i]) j = T[j].fail;
        T[T[u].ch[i]].fail = T[j].ch[i];
        Q.push(T[u].ch[i]);
      }
  }
}
inline void Query(Node *T, char *s, int f) {
  int u = 0, len = strlen(s);
  for (int i = 0; i < len; ++i) {
    int x = s[i] - 'a';
    while (u && !T[u].ch[x]) u = T[u].fail;
    if (T[u].ch[x]) {
      u = T[u].ch[x];
      int j = u;
      while (j) {
        T[j].cnt[f]++;
        j = T[j].fail;
      }
    }
  }
}
char s[50010], p[50010];
int n, L[10], R[10];
long long ans;
void dfs(Node *T, int u) {
  if (u) {
    int flag = 1;
    for (int i = 0; i < n; ++i)
      if (T[u].cnt[i] < L[i] || T[u].cnt[i] > R[i]) {
        flag = 0;
        break;
      }
    ans += flag;
  }
  for (int i = 0; i < 26; ++i)
    if (T[u].ch[i]) dfs(T, T[u].ch[i]);
}
int main() {
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i < len; ++i) insert(S, s + i, tot);
  Getfail(S);
  ans = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s%d%d", p, &L[i], &R[i]);
    Query(S, p, i);
  }
  dfs(S, 0);
  cout << ans << endl;
  return 0;
}

```