#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200;
const int ROOT_NODE = 0;
int trie[MAXN * MAXN][26];
int pValue[MAXN * MAXN][10];
string P[11];
int L[11];
int R[11];
string S;
int N, totalNode = 1;
int getIndex(char c) { return c - 'a'; }
void buildTrie(int node, int cur) {
  if (cur == N) return;
  int edge = getIndex(S[cur]);
  if (trie[node][edge] == -1) {
    trie[node][edge] = totalNode++;
  }
  buildTrie(trie[node][edge], cur + 1);
}
void doitP(int node, int cur, const int len, const int whichp) {
  if (cur == len) return;
  int edge = getIndex(P[whichp][cur]);
  if (trie[node][edge] == -1) return;
  pValue[trie[node][edge]][whichp]++;
  doitP(trie[node][edge], cur + 1, len, whichp);
}
void updateTrie(int whichp) {
  int len = P[whichp].size();
  for (int i = 0; i < len; i++) {
    doitP(ROOT_NODE, i, len, whichp);
  }
}
int main() {
  memset(trie, -1, sizeof(trie));
  cin >> S;
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) cin >> P[i] >> L[i] >> R[i];
  N = S.size();
  for (int i = 0; i < N; i++) {
    for (int j = i; j < N; j++) {
      buildTrie(ROOT_NODE, i);
    }
  }
  for (int i = 0; i < m; i++) {
    updateTrie(i);
  }
  int ret = 0;
  for (int i = 1; i < totalNode; i++) {
    int ok = 1;
    for (int j = 0; j < m; j++) {
      if (pValue[i][j] >= L[j] && pValue[i][j] <= R[j]) continue;
      ok = 0;
    }
    if (ok) ret++;
  }
  cout << ret << endl;
}

### Prompt

Your challenge is to write 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 MAXN = 200;
const int ROOT_NODE = 0;
int trie[MAXN * MAXN][26];
int pValue[MAXN * MAXN][10];
string P[11];
int L[11];
int R[11];
string S;
int N, totalNode = 1;
int getIndex(char c) { return c - 'a'; }
void buildTrie(int node, int cur) {
  if (cur == N) return;
  int edge = getIndex(S[cur]);
  if (trie[node][edge] == -1) {
    trie[node][edge] = totalNode++;
  }
  buildTrie(trie[node][edge], cur + 1);
}
void doitP(int node, int cur, const int len, const int whichp) {
  if (cur == len) return;
  int edge = getIndex(P[whichp][cur]);
  if (trie[node][edge] == -1) return;
  pValue[trie[node][edge]][whichp]++;
  doitP(trie[node][edge], cur + 1, len, whichp);
}
void updateTrie(int whichp) {
  int len = P[whichp].size();
  for (int i = 0; i < len; i++) {
    doitP(ROOT_NODE, i, len, whichp);
  }
}
int main() {
  memset(trie, -1, sizeof(trie));
  cin >> S;
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) cin >> P[i] >> L[i] >> R[i];
  N = S.size();
  for (int i = 0; i < N; i++) {
    for (int j = i; j < N; j++) {
      buildTrie(ROOT_NODE, i);
    }
  }
  for (int i = 0; i < m; i++) {
    updateTrie(i);
  }
  int ret = 0;
  for (int i = 1; i < totalNode; i++) {
    int ok = 1;
    for (int j = 0; j < m; j++) {
      if (pValue[i][j] >= L[j] && pValue[i][j] <= R[j]) continue;
      ok = 0;
    }
    if (ok) ret++;
  }
  cout << ret << endl;
}

```