#include <bits/stdc++.h>
using namespace std;
const int BASE = 31, MOD = 1e9 + 7, L = 50000 + 4;
string s, p[11];
int l[11], r[11], n;
long long power[L], hashp[L], hashs[L];
map<long long, int> cnthash[11];
void build(const string &s, long long *hash) {
  for (int i = (int)(1), _b = (int)(s.size()); i <= _b; ++i)
    hash[i] = hash[i - 1] * BASE + s[i - 1] - 'a' + 1;
}
long long get(long long *hash, const int &l, const int &r) {
  return hash[r] - hash[l - 1] * power[r - l + 1];
}
int main() {
  power[0] = 1;
  for (int i = (int)(1), _b = (int)(L - 1); i <= _b; ++i)
    power[i] = power[i - 1] * BASE;
  cin >> s;
  build(s, hashs);
  vector<long long> all;
  for (int i = (int)(1), _b = (int)(s.size()); i <= _b; ++i)
    for (int j = (int)(i), _b = (int)(s.size()); j <= _b; ++j) {
      long long cur = get(hashs, i, j);
      all.push_back(cur);
    }
  sort(all.begin(), all.end());
  all.erase(unique(all.begin(), all.end()), all.end());
  cin >> n;
  vector<int> cnt(all.size() * n, 0);
  for (int i = 0, _n = (int)(n); i < _n; ++i) {
    string p;
    cin >> p >> l[i] >> r[i];
    build(p, hashp);
    for (int l = (int)(1), _b = (int)(p.size()); l <= _b; ++l)
      for (int r = (int)(l), _b = (int)(p.size()); r <= _b; ++r) {
        long long tmp = get(hashp, l, r);
        int t = lower_bound(all.begin(), all.end(), tmp) - all.begin();
        if (t != all.size() && all[t] == tmp) {
          ++cnt[t * n + i];
        }
      }
  }
  int res = 0;
  for (int i = 0, _n = (int)(((int)(all).size())); i < _n; ++i) {
    bool bad = 0;
    for (int j = 0, _n = (int)(n); j < _n; ++j) {
      if (cnt[i * n + j] < l[j] || r[j] < cnt[i * n + j]) {
        bad = 1;
        break;
      }
    }
    res += !bad;
  }
  cout << res << endl;
  return 0;
}

### Prompt

Generate 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 BASE = 31, MOD = 1e9 + 7, L = 50000 + 4;
string s, p[11];
int l[11], r[11], n;
long long power[L], hashp[L], hashs[L];
map<long long, int> cnthash[11];
void build(const string &s, long long *hash) {
  for (int i = (int)(1), _b = (int)(s.size()); i <= _b; ++i)
    hash[i] = hash[i - 1] * BASE + s[i - 1] - 'a' + 1;
}
long long get(long long *hash, const int &l, const int &r) {
  return hash[r] - hash[l - 1] * power[r - l + 1];
}
int main() {
  power[0] = 1;
  for (int i = (int)(1), _b = (int)(L - 1); i <= _b; ++i)
    power[i] = power[i - 1] * BASE;
  cin >> s;
  build(s, hashs);
  vector<long long> all;
  for (int i = (int)(1), _b = (int)(s.size()); i <= _b; ++i)
    for (int j = (int)(i), _b = (int)(s.size()); j <= _b; ++j) {
      long long cur = get(hashs, i, j);
      all.push_back(cur);
    }
  sort(all.begin(), all.end());
  all.erase(unique(all.begin(), all.end()), all.end());
  cin >> n;
  vector<int> cnt(all.size() * n, 0);
  for (int i = 0, _n = (int)(n); i < _n; ++i) {
    string p;
    cin >> p >> l[i] >> r[i];
    build(p, hashp);
    for (int l = (int)(1), _b = (int)(p.size()); l <= _b; ++l)
      for (int r = (int)(l), _b = (int)(p.size()); r <= _b; ++r) {
        long long tmp = get(hashp, l, r);
        int t = lower_bound(all.begin(), all.end(), tmp) - all.begin();
        if (t != all.size() && all[t] == tmp) {
          ++cnt[t * n + i];
        }
      }
  }
  int res = 0;
  for (int i = 0, _n = (int)(((int)(all).size())); i < _n; ++i) {
    bool bad = 0;
    for (int j = 0, _n = (int)(n); j < _n; ++j) {
      if (cnt[i * n + j] < l[j] || r[j] < cnt[i * n + j]) {
        bad = 1;
        break;
      }
    }
    res += !bad;
  }
  cout << res << endl;
  return 0;
}

```