#include <bits/stdc++.h>
using namespace std;
string s, p;
int n, u, v, cur, cnt = 0;
int child[2000007][27];
int cou[2000007];
int f[2007][2007];
void add(char ss, int val) {
  if (!child[cur][ss - 96]) child[cur][ss - 96] = ++cnt;
  cur = child[cur][ss - 96];
  if (cou[cur] + val >= 0) cou[cur] += val;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> s;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p >> u >> v;
    if (p.size())
      for (int l = 0; l < p.size(); l++) {
        cur = 0;
        for (int r = l; r < p.size(); r++) add(p[r], 1);
      }
    if (s.size())
      for (int l = 0; l < s.size(); l++) {
        cur = 0;
        int tmp = -1;
        for (int r = l; r < s.size(); r++) {
          if (!cou[child[cur][s[r] - 96]]) {
            tmp = r;
            break;
          }
          cur = child[cur][s[r] - 96];
          if (u <= cou[cur] && cou[cur] <= v) ++f[l][r];
        }
        if (tmp != -1 && u <= 0 && 0 <= v)
          for (int r = tmp; r < s.size(); r++) ++f[l][r];
      }
    if (p.size())
      for (int l = 0; l < p.size(); l++) {
        cur = 0;
        for (int r = l; r < p.size(); r++) add(p[r], -1);
      }
  }
  int res = 0;
  if (s.size())
    for (int l = 0; l < s.size(); l++) {
      cur = 0;
      for (int r = l; r < s.size(); r++) {
        if (!cou[child[cur][s[r] - 96]]) {
          add(s[r], 1);
          if (f[l][r] == n) ++res;
        } else
          cur = child[cur][s[r] - 96];
      }
    }
  if (s.size())
    for (int l = 0; l < s.size(); l++) {
      cur = 0;
      for (int r = l; r < s.size(); r++) add(s[r], -1);
    }
  cout << res << endl;
}

### Prompt

Please create a solution in Cpp 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;
string s, p;
int n, u, v, cur, cnt = 0;
int child[2000007][27];
int cou[2000007];
int f[2007][2007];
void add(char ss, int val) {
  if (!child[cur][ss - 96]) child[cur][ss - 96] = ++cnt;
  cur = child[cur][ss - 96];
  if (cou[cur] + val >= 0) cou[cur] += val;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> s;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p >> u >> v;
    if (p.size())
      for (int l = 0; l < p.size(); l++) {
        cur = 0;
        for (int r = l; r < p.size(); r++) add(p[r], 1);
      }
    if (s.size())
      for (int l = 0; l < s.size(); l++) {
        cur = 0;
        int tmp = -1;
        for (int r = l; r < s.size(); r++) {
          if (!cou[child[cur][s[r] - 96]]) {
            tmp = r;
            break;
          }
          cur = child[cur][s[r] - 96];
          if (u <= cou[cur] && cou[cur] <= v) ++f[l][r];
        }
        if (tmp != -1 && u <= 0 && 0 <= v)
          for (int r = tmp; r < s.size(); r++) ++f[l][r];
      }
    if (p.size())
      for (int l = 0; l < p.size(); l++) {
        cur = 0;
        for (int r = l; r < p.size(); r++) add(p[r], -1);
      }
  }
  int res = 0;
  if (s.size())
    for (int l = 0; l < s.size(); l++) {
      cur = 0;
      for (int r = l; r < s.size(); r++) {
        if (!cou[child[cur][s[r] - 96]]) {
          add(s[r], 1);
          if (f[l][r] == n) ++res;
        } else
          cur = child[cur][s[r] - 96];
      }
    }
  if (s.size())
    for (int l = 0; l < s.size(); l++) {
      cur = 0;
      for (int r = l; r < s.size(); r++) add(s[r], -1);
    }
  cout << res << endl;
}

```