#include <bits/stdc++.h>
using namespace std;
struct Rule {
  string s;
  int l, r;
};
int n;
vector<int> h;
vector<vector<int> > p;
vector<Rule> rules;
void init_hash(int l) {
  int k = 2;
  h.push_back(239);
  h.push_back(23);
  p.resize(k);
  for (int i = 0; i < k; i++) {
    p[i].resize(l + 2);
    p[i][0] = 1;
    for (int j = 1; j < (int)p[i].size(); j++) {
      p[i][j] = p[i][j - 1] * h[i];
    }
  }
}
bool check_rule(Rule rule, string s) {
  swap(rule.s, s);
  if (rule.s.size() > s.size()) {
    return rule.l == 0;
  }
  int t = (int)h.size();
  vector<int> h1(t), h2(t);
  int d = (int)rule.s.size();
  for (int i = 0; i < d; i++) {
    for (int k = 0; k < t; k++) {
      h1[k] += s[i] * p[k][i];
      h2[k] += rule.s[i] * p[k][i];
    }
  }
  int matches = 0;
  for (int z = 0; matches <= rule.r && z < s.size() - d + 1; z++) {
    bool f = true;
    for (int k = 0; k < t; k++) {
      if (z > 0) {
        h2[k] *= h[k];
        h1[k] = h1[k] - s[z - 1] * p[k][z - 1] + s[d - 1 + z] * p[k][d - 1 + z];
      }
      f = f && (h1[k] == h2[k]);
    }
    if (f) {
      matches++;
    }
  }
  return rule.l <= matches && matches <= rule.r;
}
int main() {
  string s;
  cin >> s >> n;
  int mx = (int)s.size();
  Rule r;
  for (int i = 0; i < n; i++) {
    cin >> r.s >> r.l >> r.r;
    mx = max(mx, (int)r.s.size());
    rules.push_back(r);
  }
  init_hash(mx);
  set<string> u;
  for (int i = 0; i < (int)s.size(); i++) {
    for (int j = i; j < (int)s.size(); j++) {
      string sub = s.substr(i, j - i + 1);
      bool f = true;
      for (int k = 0; f && k < n; k++) {
        f = f && check_rule(rules[k], sub);
      }
      if (f) {
        u.insert(sub);
      }
    }
  }
  cout << u.size();
  return 0;
}

### Prompt

In Cpp, your task is to solve 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;
struct Rule {
  string s;
  int l, r;
};
int n;
vector<int> h;
vector<vector<int> > p;
vector<Rule> rules;
void init_hash(int l) {
  int k = 2;
  h.push_back(239);
  h.push_back(23);
  p.resize(k);
  for (int i = 0; i < k; i++) {
    p[i].resize(l + 2);
    p[i][0] = 1;
    for (int j = 1; j < (int)p[i].size(); j++) {
      p[i][j] = p[i][j - 1] * h[i];
    }
  }
}
bool check_rule(Rule rule, string s) {
  swap(rule.s, s);
  if (rule.s.size() > s.size()) {
    return rule.l == 0;
  }
  int t = (int)h.size();
  vector<int> h1(t), h2(t);
  int d = (int)rule.s.size();
  for (int i = 0; i < d; i++) {
    for (int k = 0; k < t; k++) {
      h1[k] += s[i] * p[k][i];
      h2[k] += rule.s[i] * p[k][i];
    }
  }
  int matches = 0;
  for (int z = 0; matches <= rule.r && z < s.size() - d + 1; z++) {
    bool f = true;
    for (int k = 0; k < t; k++) {
      if (z > 0) {
        h2[k] *= h[k];
        h1[k] = h1[k] - s[z - 1] * p[k][z - 1] + s[d - 1 + z] * p[k][d - 1 + z];
      }
      f = f && (h1[k] == h2[k]);
    }
    if (f) {
      matches++;
    }
  }
  return rule.l <= matches && matches <= rule.r;
}
int main() {
  string s;
  cin >> s >> n;
  int mx = (int)s.size();
  Rule r;
  for (int i = 0; i < n; i++) {
    cin >> r.s >> r.l >> r.r;
    mx = max(mx, (int)r.s.size());
    rules.push_back(r);
  }
  init_hash(mx);
  set<string> u;
  for (int i = 0; i < (int)s.size(); i++) {
    for (int j = i; j < (int)s.size(); j++) {
      string sub = s.substr(i, j - i + 1);
      bool f = true;
      for (int k = 0; f && k < n; k++) {
        f = f && check_rule(rules[k], sub);
      }
      if (f) {
        u.insert(sub);
      }
    }
  }
  cout << u.size();
  return 0;
}

```