#include <bits/stdc++.h>
using namespace std;
template <int N, int SGM>
struct SuffixAutomaton {
  int ts, whole, len[N], link[N], C[N][SGM];
  inline SuffixAutomaton() {
    memset(C, 0, sizeof(C));
    memset(len, 0, sizeof(len));
    memset(link, 0, sizeof(link));
    ts = whole = 0;
    link[0] = -1;
  }
  inline void Add(int ch) {
    int v = whole;
    whole = ++ts;
    link[whole] = 0;
    len[whole] = len[v] + 1;
    while (v >= 0 && !C[v][ch]) C[v][ch] = whole, v = link[v];
    if (v >= 0) {
      int u = C[v][ch];
      if (len[u] == len[v] + 1)
        link[whole] = u;
      else {
        ++ts;
        len[ts] = len[v] + 1;
        link[ts] = link[u];
        link[u] = link[whole] = ts;
        for (int j = 0; j < SGM; j++) C[ts][j] = C[u][j];
        while (v >= 0 && C[v][ch] == u) C[v][ch] = ts, v = link[v];
      }
    }
  }
};
const int N = 600005 * 2, SGM = 27, MXN = 11;
SuffixAutomaton<N, SGM> SA;
int n, L[MXN], R[MXN], Start[MXN], dp[N][MXN], M[N];
string S[MXN];
vector<int> Adj[N];
long long tot;
void DFS(int v) {
  if (M[v] != -1) dp[v][M[v]]++;
  for (int u : Adj[v]) {
    DFS(u);
    for (int j = 0; j <= n; j++) dp[v][j] += dp[u][j];
  }
}
int main() {
  cin >> S[0] >> n;
  memset(M, -1, sizeof(M));
  for (char ch : S[0]) SA.Add(ch - 'a'), M[SA.whole] = 0;
  L[0] = 1;
  R[0] = N;
  Start[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> S[i] >> L[i] >> R[i];
    SA.Add(26);
    Start[i] = SA.len[SA.whole];
    for (char ch : S[i]) SA.Add(ch - 'a'), M[SA.whole] = i;
  }
  for (int i = 1; i <= SA.ts; i++) Adj[SA.link[i]].push_back(i);
  DFS(0);
  for (int i = 1; i <= SA.ts; i++) {
    bool Fail = 0;
    for (int j = 0; j <= n; j++)
      if (dp[i][j] < L[j] || R[j] < dp[i][j]) Fail = 1;
    if (!Fail) tot += SA.len[i] - SA.len[SA.link[i]];
  }
  return !printf("%lld\n", tot);
}

### 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;
template <int N, int SGM>
struct SuffixAutomaton {
  int ts, whole, len[N], link[N], C[N][SGM];
  inline SuffixAutomaton() {
    memset(C, 0, sizeof(C));
    memset(len, 0, sizeof(len));
    memset(link, 0, sizeof(link));
    ts = whole = 0;
    link[0] = -1;
  }
  inline void Add(int ch) {
    int v = whole;
    whole = ++ts;
    link[whole] = 0;
    len[whole] = len[v] + 1;
    while (v >= 0 && !C[v][ch]) C[v][ch] = whole, v = link[v];
    if (v >= 0) {
      int u = C[v][ch];
      if (len[u] == len[v] + 1)
        link[whole] = u;
      else {
        ++ts;
        len[ts] = len[v] + 1;
        link[ts] = link[u];
        link[u] = link[whole] = ts;
        for (int j = 0; j < SGM; j++) C[ts][j] = C[u][j];
        while (v >= 0 && C[v][ch] == u) C[v][ch] = ts, v = link[v];
      }
    }
  }
};
const int N = 600005 * 2, SGM = 27, MXN = 11;
SuffixAutomaton<N, SGM> SA;
int n, L[MXN], R[MXN], Start[MXN], dp[N][MXN], M[N];
string S[MXN];
vector<int> Adj[N];
long long tot;
void DFS(int v) {
  if (M[v] != -1) dp[v][M[v]]++;
  for (int u : Adj[v]) {
    DFS(u);
    for (int j = 0; j <= n; j++) dp[v][j] += dp[u][j];
  }
}
int main() {
  cin >> S[0] >> n;
  memset(M, -1, sizeof(M));
  for (char ch : S[0]) SA.Add(ch - 'a'), M[SA.whole] = 0;
  L[0] = 1;
  R[0] = N;
  Start[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> S[i] >> L[i] >> R[i];
    SA.Add(26);
    Start[i] = SA.len[SA.whole];
    for (char ch : S[i]) SA.Add(ch - 'a'), M[SA.whole] = i;
  }
  for (int i = 1; i <= SA.ts; i++) Adj[SA.link[i]].push_back(i);
  DFS(0);
  for (int i = 1; i <= SA.ts; i++) {
    bool Fail = 0;
    for (int j = 0; j <= n; j++)
      if (dp[i][j] < L[j] || R[j] < dp[i][j]) Fail = 1;
    if (!Fail) tot += SA.len[i] - SA.len[SA.link[i]];
  }
  return !printf("%lld\n", tot);
}

```