#include <bits/stdc++.h>
using namespace std;
string s;
int n;
bool p_sum[11][50200];
int p_ssum[11][50200];
string rules[11];
int r_b[11];
int r_e[11];
int lens[11];
int sizes[11];
vector<int> z(string s) {
  int n = (int)s.length();
  vector<int> pi(n);
  for (int i = 1; i < n; ++i) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
int correct() {
  for (long long int i = 0; i < int(n); ++i) {
    if (sizes[i] < r_b[i]) return -100;
    if (sizes[i] > r_e[i]) return 100;
  }
  return 0;
}
int getSum(int k, int s, int e) {
  if (s > e) return -100;
  int ss = p_ssum[k][e];
  if (s) ss -= p_ssum[k][s - 1];
  return ss;
}
int main() {
  cin >> s;
  cin >> n;
  for (long long int i = 0; i < int(n); ++i) {
    cin >> rules[i] >> r_b[i] >> r_e[i];
    vector<int> v = z(rules[i] + "#" + s);
    lens[i] = rules[i].length();
  }
  long long int ans = 0;
  set<string> setS;
  for (int i = 0; i < s.length(); ++i) {
    for (int j = i; j < s.length(); ++j) {
      bool f = true;
      string ns = s.substr(i, j - i + 1);
      for (long long int k = 0; k < int(n); ++k) {
        int cnt = 0;
        for (int ii = ns.length(); ii <= rules[k].length(); ++ii) {
          string ns2 = rules[k].substr(ii - ns.length(), ns.length());
          if (rules[k].substr(ii - ns.length(), ns.length()) == ns) ++cnt;
        }
        if (cnt > r_e[k] || cnt < r_b[k]) {
          f = false;
        }
      }
      if (f) setS.insert(ns);
    }
  }
  cout << setS.size() << endl;
  return 0;
}

### Prompt

Develop a solution in cpp to the problem described below:

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;
int n;
bool p_sum[11][50200];
int p_ssum[11][50200];
string rules[11];
int r_b[11];
int r_e[11];
int lens[11];
int sizes[11];
vector<int> z(string s) {
  int n = (int)s.length();
  vector<int> pi(n);
  for (int i = 1; i < n; ++i) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
int correct() {
  for (long long int i = 0; i < int(n); ++i) {
    if (sizes[i] < r_b[i]) return -100;
    if (sizes[i] > r_e[i]) return 100;
  }
  return 0;
}
int getSum(int k, int s, int e) {
  if (s > e) return -100;
  int ss = p_ssum[k][e];
  if (s) ss -= p_ssum[k][s - 1];
  return ss;
}
int main() {
  cin >> s;
  cin >> n;
  for (long long int i = 0; i < int(n); ++i) {
    cin >> rules[i] >> r_b[i] >> r_e[i];
    vector<int> v = z(rules[i] + "#" + s);
    lens[i] = rules[i].length();
  }
  long long int ans = 0;
  set<string> setS;
  for (int i = 0; i < s.length(); ++i) {
    for (int j = i; j < s.length(); ++j) {
      bool f = true;
      string ns = s.substr(i, j - i + 1);
      for (long long int k = 0; k < int(n); ++k) {
        int cnt = 0;
        for (int ii = ns.length(); ii <= rules[k].length(); ++ii) {
          string ns2 = rules[k].substr(ii - ns.length(), ns.length());
          if (rules[k].substr(ii - ns.length(), ns.length()) == ns) ++cnt;
        }
        if (cnt > r_e[k] || cnt < r_b[k]) {
          f = false;
        }
      }
      if (f) setS.insert(ns);
    }
  }
  cout << setS.size() << endl;
  return 0;
}

```