#include <bits/stdc++.h>
using namespace std;
struct node {
  int ch[26];
  void Init() { memset(ch, 0, sizeof(ch)); }
} pt[2020304];
int now = 0;
int cur = 0;
bool imp[2020304];
void ins(int t, char *s) {
  if (s[1] == '#') {
    imp[t] = true;
    return;
  }
  int c = s[1] - 'a';
  int son = pt[t].ch[c];
  if (son == 0) pt[son = pt[t].ch[c] = ++now].Init();
  ins(son, ++s);
}
bool can[2020][2020];
int s[2020304], app[2020304];
char S[1020304], a[1020304];
int p;
int main() {
  scanf("%s", S + 1);
  int n = strlen(S + 1);
  cin >> p;
  for (int i = 1; i <= n; ++i)
    for (int j = i; j <= n; ++j) can[i][j] = true;
  for (int TTT = 1; TTT <= p; ++TTT) {
    if (TTT == 2) {
      int z = TTT;
    }
    scanf("%s", a + 1);
    int len = strlen(a + 1);
    int l, r;
    scanf("%d%d", &l, &r);
    now = 1;
    pt[1].Init();
    a[len + 1] = '#';
    memset(imp, 0, sizeof(imp));
    for (int i = 0; i <= len - 1; ++i) ins(1, a + i);
    memset(s, 0, sizeof(s));
    for (int i = now; i >= 1; --i) {
      s[i] = imp[i];
      for (int j = 0; j <= 25; ++j) s[i] += s[pt[i].ch[j]];
    }
    for (int i = 1; i <= n; ++i) {
      if (i == 3) {
        int z = i;
      }
      int cur = 1;
      for (int j = i; j <= n; ++j) {
        cur = pt[cur].ch[S[j] - 'a'];
        can[i][j] &= (s[cur] >= l && s[cur] <= r);
      }
    }
  }
  now = 1;
  S[n + 1] = '#';
  pt[1].Init();
  for (int i = 0; i <= n - 1; ++i) ins(1, S + i);
  memset(app, 0, sizeof(app));
  for (int i = 1; i <= n; ++i) {
    if (i == 3) {
      int z = i;
    }
    int cur = 1;
    for (int j = i; j <= n; ++j) {
      cur = pt[cur].ch[S[j] - 'a'];
      app[cur] |= can[i][j];
    }
  }
  int ans = 0;
  for (int i = 2; i <= now; ++i)
    if (app[i]) ++ans;
  cout << ans << endl;
  return 0;
}

### Prompt

Generate 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;
struct node {
  int ch[26];
  void Init() { memset(ch, 0, sizeof(ch)); }
} pt[2020304];
int now = 0;
int cur = 0;
bool imp[2020304];
void ins(int t, char *s) {
  if (s[1] == '#') {
    imp[t] = true;
    return;
  }
  int c = s[1] - 'a';
  int son = pt[t].ch[c];
  if (son == 0) pt[son = pt[t].ch[c] = ++now].Init();
  ins(son, ++s);
}
bool can[2020][2020];
int s[2020304], app[2020304];
char S[1020304], a[1020304];
int p;
int main() {
  scanf("%s", S + 1);
  int n = strlen(S + 1);
  cin >> p;
  for (int i = 1; i <= n; ++i)
    for (int j = i; j <= n; ++j) can[i][j] = true;
  for (int TTT = 1; TTT <= p; ++TTT) {
    if (TTT == 2) {
      int z = TTT;
    }
    scanf("%s", a + 1);
    int len = strlen(a + 1);
    int l, r;
    scanf("%d%d", &l, &r);
    now = 1;
    pt[1].Init();
    a[len + 1] = '#';
    memset(imp, 0, sizeof(imp));
    for (int i = 0; i <= len - 1; ++i) ins(1, a + i);
    memset(s, 0, sizeof(s));
    for (int i = now; i >= 1; --i) {
      s[i] = imp[i];
      for (int j = 0; j <= 25; ++j) s[i] += s[pt[i].ch[j]];
    }
    for (int i = 1; i <= n; ++i) {
      if (i == 3) {
        int z = i;
      }
      int cur = 1;
      for (int j = i; j <= n; ++j) {
        cur = pt[cur].ch[S[j] - 'a'];
        can[i][j] &= (s[cur] >= l && s[cur] <= r);
      }
    }
  }
  now = 1;
  S[n + 1] = '#';
  pt[1].Init();
  for (int i = 0; i <= n - 1; ++i) ins(1, S + i);
  memset(app, 0, sizeof(app));
  for (int i = 1; i <= n; ++i) {
    if (i == 3) {
      int z = i;
    }
    int cur = 1;
    for (int j = i; j <= n; ++j) {
      cur = pt[cur].ch[S[j] - 'a'];
      app[cur] |= can[i][j];
    }
  }
  int ans = 0;
  for (int i = 2; i <= now; ++i)
    if (app[i]) ++ans;
  cout << ans << endl;
  return 0;
}

```