#include <bits/stdc++.h>
using namespace std;
namespace sam {
const int N = 1200010, M = 26;
int tr[N][M], pr[N], ln[N], nw = 1;
int add(int c, int lst) {
  if (tr[lst][c] && ln[tr[lst][c]] == ln[lst] + 1) return tr[lst][c];
  int p = lst, np = ++nw;
  ln[np] = ln[p] + 1;
  for (; p && !tr[p][c]; p = pr[p]) tr[p][c] = np;
  if (!p)
    pr[np] = 1;
  else {
    int q = tr[p][c];
    if (ln[p] + 1 == ln[q])
      pr[np] = q;
    else {
      int nq = ++nw;
      ln[nq] = ln[p] + 1;
      pr[nq] = pr[q];
      copy(tr[q], tr[q] + M, tr[nq]);
      pr[q] = pr[np] = nq;
      for (; p && tr[p][c] == q; p = pr[p]) tr[p][c] = nq;
    }
  }
  return np;
}
}  // namespace sam
int cnt[1200010][11];
using namespace sam;
int lft[11], rght[11], n;
char tmp[50010];
bool cmp(int x, int y) { return ln[x] > ln[y]; }
int main() {
  scanf("%s", tmp + 1);
  for (int u = 1, i = 1; tmp[i]; ++i) {
    u = add(tmp[i] - 'a', u);
    ++cnt[u][0];
  }
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%s%d%d", tmp + 1, &lft[i], &rght[i]);
    for (int u = 1, j = 1; tmp[j]; ++j) {
      u = add(tmp[j] - 'a', u);
      ++cnt[u][i];
    }
  }
  static int tmp[600010 * 2];
  for (int i = 1; i <= nw; ++i) tmp[i] = i;
  sort(tmp + 1, tmp + nw + 1, cmp);
  for (int i = 1; i <= nw; ++i) {
    int u = tmp[i];
    for (int j = 0; j <= n; ++j) cnt[pr[u]][j] += cnt[u][j];
  }
  long long ans = 0;
  for (int i = 1; i <= nw; ++i) {
    int flg = 1;
    for (int j = 1; j <= n; ++j)
      if (cnt[i][j] >= lft[j] && cnt[i][j] <= rght[j]) {
      } else
        flg = 0;
    if (flg && cnt[i][0]) ans += ln[i] - ln[pr[i]];
  }
  printf("%I64d\n", ans);
  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;
namespace sam {
const int N = 1200010, M = 26;
int tr[N][M], pr[N], ln[N], nw = 1;
int add(int c, int lst) {
  if (tr[lst][c] && ln[tr[lst][c]] == ln[lst] + 1) return tr[lst][c];
  int p = lst, np = ++nw;
  ln[np] = ln[p] + 1;
  for (; p && !tr[p][c]; p = pr[p]) tr[p][c] = np;
  if (!p)
    pr[np] = 1;
  else {
    int q = tr[p][c];
    if (ln[p] + 1 == ln[q])
      pr[np] = q;
    else {
      int nq = ++nw;
      ln[nq] = ln[p] + 1;
      pr[nq] = pr[q];
      copy(tr[q], tr[q] + M, tr[nq]);
      pr[q] = pr[np] = nq;
      for (; p && tr[p][c] == q; p = pr[p]) tr[p][c] = nq;
    }
  }
  return np;
}
}  // namespace sam
int cnt[1200010][11];
using namespace sam;
int lft[11], rght[11], n;
char tmp[50010];
bool cmp(int x, int y) { return ln[x] > ln[y]; }
int main() {
  scanf("%s", tmp + 1);
  for (int u = 1, i = 1; tmp[i]; ++i) {
    u = add(tmp[i] - 'a', u);
    ++cnt[u][0];
  }
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%s%d%d", tmp + 1, &lft[i], &rght[i]);
    for (int u = 1, j = 1; tmp[j]; ++j) {
      u = add(tmp[j] - 'a', u);
      ++cnt[u][i];
    }
  }
  static int tmp[600010 * 2];
  for (int i = 1; i <= nw; ++i) tmp[i] = i;
  sort(tmp + 1, tmp + nw + 1, cmp);
  for (int i = 1; i <= nw; ++i) {
    int u = tmp[i];
    for (int j = 0; j <= n; ++j) cnt[pr[u]][j] += cnt[u][j];
  }
  long long ans = 0;
  for (int i = 1; i <= nw; ++i) {
    int flg = 1;
    for (int j = 1; j <= n; ++j)
      if (cnt[i][j] >= lft[j] && cnt[i][j] <= rght[j]) {
      } else
        flg = 0;
    if (flg && cnt[i][0]) ans += ln[i] - ln[pr[i]];
  }
  printf("%I64d\n", ans);
  return 0;
}

```