#include <bits/stdc++.h>
using namespace std;
const long long N = 10 + 2;
const long long M = 200 + 10;
const long long MOD = 1e9 + 7;
const long long BASE = 401;
pair<string, pair<long long, long long> > law[N];
long long hashh[M], h[N][M];
long long n, ans, power[M];
map<long long, bool> mark;
string s;
long long s_get(long long st, long long en) {
  long long anis = hashh[en];
  if (st == 0) return anis;
  long long len = (en - st + 1);
  anis -= ((hashh[st - 1] * power[len]) % MOD);
  anis += (3 * MOD);
  anis %= MOD;
  return anis;
}
long long law_get(long long id, long long st, long long en) {
  long long anis = h[id][en];
  if (st == 0) return anis;
  long long len = (en - st + 1);
  anis -= ((h[id][st - 1] * power[len]) % MOD);
  anis += (3 * MOD);
  anis %= MOD;
  return anis;
}
int32_t main() {
  cin >> s >> n;
  for (long long i = 0; i < n; ++i)
    cin >> law[i].first >> law[i].second.first >> law[i].second.second;
  power[0] = 1;
  for (long long i = 1; i < M; ++i)
    power[i] = power[i - 1] * BASE, power[i] %= MOD;
  hashh[0] = (long long)(s[0] - 'a' + 1);
  for (long long i = 1; i < s.size(); ++i)
    hashh[i] = hashh[i - 1] * BASE, hashh[i] += (long long)(s[i] - 'a' + 1),
    hashh[i] %= MOD;
  for (long long i = 0; i < n; ++i) {
    h[i][0] = (long long)(law[i].first[0] - 'a' + 1);
    for (long long j = 1; j < law[i].first.size(); ++j)
      h[i][j] = h[i][j - 1] * BASE,
      h[i][j] += (long long)(law[i].first[j] - 'a' + 1), h[i][j] %= MOD;
  }
  long long help, help1, help2;
  bool flag;
  for (long long i = 0; i < s.size(); ++i)
    for (long long j = i; j < s.size(); ++j) {
      help = s_get(i, j);
      flag = true;
      for (long long k = 0; k < n; ++k) {
        if (law[k].first.size() < (j - i + 1)) {
          if (law[k].second.first != 0) {
            flag = false;
            break;
          }
          continue;
        }
        help1 = 0;
        for (long long kk = 0; kk < (law[k].first.size() - (j - i + 1) + 1);
             ++kk) {
          help2 = law_get(k, kk, kk + (j - i + 1) - 1);
          if (help2 == help) help1++;
        }
        if ((help1 < law[k].second.first) or (help1 > law[k].second.second)) {
          flag = false;
          break;
        }
      }
      if (flag) {
        if (!mark[help]) {
          ans++;
          mark[help] = true;
        }
      }
    }
  cout << ans;
}

### 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;
const long long N = 10 + 2;
const long long M = 200 + 10;
const long long MOD = 1e9 + 7;
const long long BASE = 401;
pair<string, pair<long long, long long> > law[N];
long long hashh[M], h[N][M];
long long n, ans, power[M];
map<long long, bool> mark;
string s;
long long s_get(long long st, long long en) {
  long long anis = hashh[en];
  if (st == 0) return anis;
  long long len = (en - st + 1);
  anis -= ((hashh[st - 1] * power[len]) % MOD);
  anis += (3 * MOD);
  anis %= MOD;
  return anis;
}
long long law_get(long long id, long long st, long long en) {
  long long anis = h[id][en];
  if (st == 0) return anis;
  long long len = (en - st + 1);
  anis -= ((h[id][st - 1] * power[len]) % MOD);
  anis += (3 * MOD);
  anis %= MOD;
  return anis;
}
int32_t main() {
  cin >> s >> n;
  for (long long i = 0; i < n; ++i)
    cin >> law[i].first >> law[i].second.first >> law[i].second.second;
  power[0] = 1;
  for (long long i = 1; i < M; ++i)
    power[i] = power[i - 1] * BASE, power[i] %= MOD;
  hashh[0] = (long long)(s[0] - 'a' + 1);
  for (long long i = 1; i < s.size(); ++i)
    hashh[i] = hashh[i - 1] * BASE, hashh[i] += (long long)(s[i] - 'a' + 1),
    hashh[i] %= MOD;
  for (long long i = 0; i < n; ++i) {
    h[i][0] = (long long)(law[i].first[0] - 'a' + 1);
    for (long long j = 1; j < law[i].first.size(); ++j)
      h[i][j] = h[i][j - 1] * BASE,
      h[i][j] += (long long)(law[i].first[j] - 'a' + 1), h[i][j] %= MOD;
  }
  long long help, help1, help2;
  bool flag;
  for (long long i = 0; i < s.size(); ++i)
    for (long long j = i; j < s.size(); ++j) {
      help = s_get(i, j);
      flag = true;
      for (long long k = 0; k < n; ++k) {
        if (law[k].first.size() < (j - i + 1)) {
          if (law[k].second.first != 0) {
            flag = false;
            break;
          }
          continue;
        }
        help1 = 0;
        for (long long kk = 0; kk < (law[k].first.size() - (j - i + 1) + 1);
             ++kk) {
          help2 = law_get(k, kk, kk + (j - i + 1) - 1);
          if (help2 == help) help1++;
        }
        if ((help1 < law[k].second.first) or (help1 > law[k].second.second)) {
          flag = false;
          break;
        }
      }
      if (flag) {
        if (!mark[help]) {
          ans++;
          mark[help] = true;
        }
      }
    }
  cout << ans;
}

```