#include <bits/stdc++.h>
using namespace std;
string str;
long long h1[2005][2005], h2[5000000];
vector<long long> vec;
int n;
short ans[12][2005][2005];
struct armen {
  string str;
  int left, right;
};
armen mas[20];
map<long long, bool> m;
int main() {
  cin >> str >> n;
  for (int i = 1; i <= n; i++) {
    cin >> mas[i].str >> mas[i].left >> mas[i].right;
  }
  for (int i = 0; i < str.size(); i++) {
    h1[i][i] = (str[i] - 'a' + 1);
    for (int j = i + 1; j < str.size(); j++) {
      h1[i][j] = 29L * h1[i][j - 1] + (str[j] - 'a' + 1);
    }
  }
  for (int i = 1; i <= n; i++) {
    vec.clear();
    for (int j = 0; j < mas[i].str.size(); j++) {
      long long h = 0;
      for (int g = j; g < mas[i].str.size(); g++) {
        h = 29L * h + (mas[i].str[g] - 'a' + 1);
        vec.push_back(h);
      }
    }
    sort(vec.begin(), vec.end());
    for (int j = 0; j < str.size(); j++) {
      for (int g = j; g < str.size(); g++) {
        if (i == 2 && j == 2 && g == 3) {
          i++;
          i--;
        }
        ans[i][j][g] = upper_bound(vec.begin(), vec.end(), h1[j][g]) -
                       lower_bound(vec.begin(), vec.end(), h1[j][g]);
      }
    }
  }
  int ans2 = 0;
  for (int i = 0; i < str.size(); i++) {
    for (int j = i; j < str.size(); j++) {
      int ind = 0;
      int x = m[30];
      if (m[h1[i][j]] == 0) {
        m[h1[i][j]] = 1;
        for (int g = 1; g <= n; g++) {
          if (ans[g][i][j] < mas[g].left || ans[g][i][j] > mas[g].right) {
            ind = 1;
            break;
          }
        }
        if (ind == 0) {
          ans2++;
        }
      }
    }
  }
  cout << ans2 << 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 str;
long long h1[2005][2005], h2[5000000];
vector<long long> vec;
int n;
short ans[12][2005][2005];
struct armen {
  string str;
  int left, right;
};
armen mas[20];
map<long long, bool> m;
int main() {
  cin >> str >> n;
  for (int i = 1; i <= n; i++) {
    cin >> mas[i].str >> mas[i].left >> mas[i].right;
  }
  for (int i = 0; i < str.size(); i++) {
    h1[i][i] = (str[i] - 'a' + 1);
    for (int j = i + 1; j < str.size(); j++) {
      h1[i][j] = 29L * h1[i][j - 1] + (str[j] - 'a' + 1);
    }
  }
  for (int i = 1; i <= n; i++) {
    vec.clear();
    for (int j = 0; j < mas[i].str.size(); j++) {
      long long h = 0;
      for (int g = j; g < mas[i].str.size(); g++) {
        h = 29L * h + (mas[i].str[g] - 'a' + 1);
        vec.push_back(h);
      }
    }
    sort(vec.begin(), vec.end());
    for (int j = 0; j < str.size(); j++) {
      for (int g = j; g < str.size(); g++) {
        if (i == 2 && j == 2 && g == 3) {
          i++;
          i--;
        }
        ans[i][j][g] = upper_bound(vec.begin(), vec.end(), h1[j][g]) -
                       lower_bound(vec.begin(), vec.end(), h1[j][g]);
      }
    }
  }
  int ans2 = 0;
  for (int i = 0; i < str.size(); i++) {
    for (int j = i; j < str.size(); j++) {
      int ind = 0;
      int x = m[30];
      if (m[h1[i][j]] == 0) {
        m[h1[i][j]] = 1;
        for (int g = 1; g <= n; g++) {
          if (ans[g][i][j] < mas[g].left || ans[g][i][j] > mas[g].right) {
            ind = 1;
            break;
          }
        }
        if (ind == 0) {
          ans2++;
        }
      }
    }
  }
  cout << ans2 << endl;
  return 0;
}

```