#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long linf = 1e18 + 5;
const int N = 2 * 50000 + 5;
const int K = 10 + 1;
const int LOG = 18;
int n, q, rn, m[K], mylog[N], curs[N], st[N], nd[N], suf[K][N], sorted[K][N],
    res[K][N], rmq[K][LOG][N], dp[K][N];
pair<int, int> C[N];
char s[N], cur[N], a[K][N];
bool cmp(int x, int y) { return C[x] < C[y]; }
void lcp_table(int w, int n) {
  for (int i = 1; i <= n; i++) curs[i] = i;
  for (int i = 1; i <= n; i++) suf[w][i] = cur[i];
  for (int i = 1; i <= LOG - 1; i++) {
    for (int j = 1; j <= n; j++)
      if (j + (1 << i - 1) <= n)
        C[j] = make_pair(suf[w][j], suf[w][j + (1 << i - 1)]);
      else
        C[j] = make_pair(suf[w][j], 0);
    sort(curs + 1, curs + n + 1, cmp);
    for (int j = 1; j <= n; j++)
      suf[w][curs[j]] = suf[w][curs[j - 1]] + (C[curs[j]] != C[curs[j - 1]]);
  }
  for (int i = 1; i <= n; i++) sorted[w][suf[w][i]] = i;
  int j = 0;
  for (int i = 1; i <= n; i++) {
    if (suf[w][i] == 1) continue;
    while (i + j <= n and sorted[w][suf[w][i] - 1] + j <= n and
           cur[i + j] == cur[sorted[w][suf[w][i] - 1] + j])
      j++;
    res[w][suf[w][i]] = j;
    if (j) j--;
  }
  for (int i = 1; i <= n; i++) rmq[w][0][i] = res[w][i];
  for (int i = 1; i <= LOG - 1; i++)
    for (int j = 1; j <= n; j++)
      rmq[w][i][j] =
          min(rmq[w][i - 1][j], rmq[w][i - 1][min(n, j + (1 << i - 1))]);
  for (int i = 1; i <= n; i++)
    dp[w][i] = dp[w][i - 1] + (sorted[w][i] > rn + 1);
}
int get(int w, int x, int y) {
  if (x == y) return n + m[w] + 1 - sorted[w][x] + 1;
  x++;
  int k = mylog[y - x + 1];
  return min(rmq[w][k][x], rmq[w][k][y - (1 << k) + 1]);
}
int occur(int w, int x, int k) {
  int l = 1, r = suf[w][x];
  while (l < r) {
    int m = l + r >> 1;
    if (get(w, m, suf[w][x]) >= k)
      r = m;
    else
      l = m + 1;
  }
  int start = l;
  l = suf[w][x], r = n + m[w] + 1;
  while (l + 1 < r) {
    int m = l + r >> 1;
    if (get(w, suf[w][x], m) >= k)
      l = m;
    else
      r = m - 1;
  }
  if (get(w, suf[w][x], r) >= k) l = r;
  int finish = l;
  return dp[w][finish] - dp[w][start - 1];
}
int bs1(int w, int x) {
  if (occur(w, x, n - x + 1) > nd[w]) return n + 1;
  int l = 1, r = n - x + 1;
  while (l < r) {
    int m = l + r >> 1;
    if (occur(w, x, m) <= nd[w])
      r = m;
    else
      l = m + 1;
  }
  return l;
}
int bs2(int w, int x) {
  if (occur(w, x, 1) < st[w]) return 0;
  int l = 1, r = n - x + 1;
  while (l + 1 < r) {
    int m = l + r >> 1;
    if (occur(w, x, m) >= st[w])
      l = m;
    else
      r = m - 1;
  }
  if (occur(w, x, r) >= st[w]) l = r;
  return l;
}
int main() {
  for (int i = 2; i <= N - 1; i++) mylog[i] = mylog[i >> 1] + 1;
  scanf("%s", s + 1);
  n = strlen(s + 1);
  rn = n;
  for (int i = 1; i <= n; i++) cur[i] = s[i];
  cur[n + 1] = '#';
  lcp_table(0, n);
  cin >> q;
  for (int i = 1; i <= q; i++) {
    scanf("%s", a[i] + 1);
    m[i] = strlen(a[i] + 1);
    for (int j = n + 2; j <= n + 2 + m[i] - 1; j++)
      cur[j] = a[i][j - n - 2 + 1];
    lcp_table(i, n + m[i] + 1);
    cin >> st[i] >> nd[i];
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int l = 0, r = n - sorted[0][i] + 1;
    for (int w = 1; w <= q; w++) {
      l = max(l, bs1(w, sorted[0][i]));
      r = min(r, bs2(w, sorted[0][i]));
    }
    l = max(l, res[0][i] + 1);
    ans += max(0, r - l + 1);
  }
  cout << ans << '\n';
  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;
const int inf = 1e9 + 5;
const long long linf = 1e18 + 5;
const int N = 2 * 50000 + 5;
const int K = 10 + 1;
const int LOG = 18;
int n, q, rn, m[K], mylog[N], curs[N], st[N], nd[N], suf[K][N], sorted[K][N],
    res[K][N], rmq[K][LOG][N], dp[K][N];
pair<int, int> C[N];
char s[N], cur[N], a[K][N];
bool cmp(int x, int y) { return C[x] < C[y]; }
void lcp_table(int w, int n) {
  for (int i = 1; i <= n; i++) curs[i] = i;
  for (int i = 1; i <= n; i++) suf[w][i] = cur[i];
  for (int i = 1; i <= LOG - 1; i++) {
    for (int j = 1; j <= n; j++)
      if (j + (1 << i - 1) <= n)
        C[j] = make_pair(suf[w][j], suf[w][j + (1 << i - 1)]);
      else
        C[j] = make_pair(suf[w][j], 0);
    sort(curs + 1, curs + n + 1, cmp);
    for (int j = 1; j <= n; j++)
      suf[w][curs[j]] = suf[w][curs[j - 1]] + (C[curs[j]] != C[curs[j - 1]]);
  }
  for (int i = 1; i <= n; i++) sorted[w][suf[w][i]] = i;
  int j = 0;
  for (int i = 1; i <= n; i++) {
    if (suf[w][i] == 1) continue;
    while (i + j <= n and sorted[w][suf[w][i] - 1] + j <= n and
           cur[i + j] == cur[sorted[w][suf[w][i] - 1] + j])
      j++;
    res[w][suf[w][i]] = j;
    if (j) j--;
  }
  for (int i = 1; i <= n; i++) rmq[w][0][i] = res[w][i];
  for (int i = 1; i <= LOG - 1; i++)
    for (int j = 1; j <= n; j++)
      rmq[w][i][j] =
          min(rmq[w][i - 1][j], rmq[w][i - 1][min(n, j + (1 << i - 1))]);
  for (int i = 1; i <= n; i++)
    dp[w][i] = dp[w][i - 1] + (sorted[w][i] > rn + 1);
}
int get(int w, int x, int y) {
  if (x == y) return n + m[w] + 1 - sorted[w][x] + 1;
  x++;
  int k = mylog[y - x + 1];
  return min(rmq[w][k][x], rmq[w][k][y - (1 << k) + 1]);
}
int occur(int w, int x, int k) {
  int l = 1, r = suf[w][x];
  while (l < r) {
    int m = l + r >> 1;
    if (get(w, m, suf[w][x]) >= k)
      r = m;
    else
      l = m + 1;
  }
  int start = l;
  l = suf[w][x], r = n + m[w] + 1;
  while (l + 1 < r) {
    int m = l + r >> 1;
    if (get(w, suf[w][x], m) >= k)
      l = m;
    else
      r = m - 1;
  }
  if (get(w, suf[w][x], r) >= k) l = r;
  int finish = l;
  return dp[w][finish] - dp[w][start - 1];
}
int bs1(int w, int x) {
  if (occur(w, x, n - x + 1) > nd[w]) return n + 1;
  int l = 1, r = n - x + 1;
  while (l < r) {
    int m = l + r >> 1;
    if (occur(w, x, m) <= nd[w])
      r = m;
    else
      l = m + 1;
  }
  return l;
}
int bs2(int w, int x) {
  if (occur(w, x, 1) < st[w]) return 0;
  int l = 1, r = n - x + 1;
  while (l + 1 < r) {
    int m = l + r >> 1;
    if (occur(w, x, m) >= st[w])
      l = m;
    else
      r = m - 1;
  }
  if (occur(w, x, r) >= st[w]) l = r;
  return l;
}
int main() {
  for (int i = 2; i <= N - 1; i++) mylog[i] = mylog[i >> 1] + 1;
  scanf("%s", s + 1);
  n = strlen(s + 1);
  rn = n;
  for (int i = 1; i <= n; i++) cur[i] = s[i];
  cur[n + 1] = '#';
  lcp_table(0, n);
  cin >> q;
  for (int i = 1; i <= q; i++) {
    scanf("%s", a[i] + 1);
    m[i] = strlen(a[i] + 1);
    for (int j = n + 2; j <= n + 2 + m[i] - 1; j++)
      cur[j] = a[i][j - n - 2 + 1];
    lcp_table(i, n + m[i] + 1);
    cin >> st[i] >> nd[i];
  }
  long long ans = 0;
  for (int i = 1; i <= n; i++) {
    int l = 0, r = n - sorted[0][i] + 1;
    for (int w = 1; w <= q; w++) {
      l = max(l, bs1(w, sorted[0][i]));
      r = min(r, bs2(w, sorted[0][i]));
    }
    l = max(l, res[0][i] + 1);
    ans += max(0, r - l + 1);
  }
  cout << ans << '\n';
  return 0;
}

```