#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
template <class t>
void print(t x, int end = 1) {
  cout << x << (end == 1 ? "\n" : " ");
}
template <class T>
void print(const vector<T> &v, int end = 1) {
  for (int i = 0; i < ((int)v.size()); i++) {
    print(v[i], 0);
  }
  cout << endl;
}
template <class T>
void print(const set<T> &v, int end = 1) {
  for (auto to = v.begin(); to != v.end(); to++) {
    print(*to);
  }
  cout << endl;
}
template <class T>
void print(const map<T, T> &v, int end = 1) {
  for (auto to : v) {
    print(to.first, 0);
    cout << ": ";
    print(to.second);
  }
}
template <class t>
void errprint(t x, int end = 1) {
  cerr << x << (end == 1 ? "\n" : " ");
}
void solve();
clock_t start_time;
double get_current_time() {
  return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
  ios_base::sync_with_stdio(false);
  solve();
}
string s;
int q;
vector<pair<string, ii>> req_save;
set<string> ans;
vector<int> zfunc(string &s) {
  int n = (int)s.size();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; i++) {
    if (i <= r) z[i] = min(z[i - l], r - i + 1);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
bool LUL(string &t, string &si, int l, int r) {
  string reqi = t + si;
  vector<int> z = zfunc(reqi);
  int cnt = 0;
  for (int i = (int)t.size(); i < ((int)z.size()); i++) {
    if (z[i] < (int)t.size()) continue;
    ++cnt;
  }
  return l <= cnt && cnt <= r;
}
bool check(string &t) {
  bool ok = true;
  for (int i = 0; i < (q); i++) {
    if (LUL(t, req_save[i].first, req_save[i].second.first,
            req_save[i].second.second))
      continue;
    ok = false;
    break;
  }
  return ok;
}
void solve() {
  cin >> s >> q;
  req_save = vector<pair<string, ii>>(q);
  for (int i = 0; i < (q); i++) {
    cin >> req_save[i].first >> req_save[i].second.first >>
        req_save[i].second.second;
  }
  for (int i = 0; i < (s.size()); i++) {
    for (int j = i; j < (s.size()); j++) {
      string r = "";
      for (int k = i; k < (j + 1); k++) r += s[k];
      if (check(r)) {
        ans.insert(r);
      }
    }
  }
  cout << ans.size() << endl;
}

### 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;
using ll = long long;
using ii = pair<int, int>;
template <class t>
void print(t x, int end = 1) {
  cout << x << (end == 1 ? "\n" : " ");
}
template <class T>
void print(const vector<T> &v, int end = 1) {
  for (int i = 0; i < ((int)v.size()); i++) {
    print(v[i], 0);
  }
  cout << endl;
}
template <class T>
void print(const set<T> &v, int end = 1) {
  for (auto to = v.begin(); to != v.end(); to++) {
    print(*to);
  }
  cout << endl;
}
template <class T>
void print(const map<T, T> &v, int end = 1) {
  for (auto to : v) {
    print(to.first, 0);
    cout << ": ";
    print(to.second);
  }
}
template <class t>
void errprint(t x, int end = 1) {
  cerr << x << (end == 1 ? "\n" : " ");
}
void solve();
clock_t start_time;
double get_current_time() {
  return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
  ios_base::sync_with_stdio(false);
  solve();
}
string s;
int q;
vector<pair<string, ii>> req_save;
set<string> ans;
vector<int> zfunc(string &s) {
  int n = (int)s.size();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; i++) {
    if (i <= r) z[i] = min(z[i - l], r - i + 1);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
bool LUL(string &t, string &si, int l, int r) {
  string reqi = t + si;
  vector<int> z = zfunc(reqi);
  int cnt = 0;
  for (int i = (int)t.size(); i < ((int)z.size()); i++) {
    if (z[i] < (int)t.size()) continue;
    ++cnt;
  }
  return l <= cnt && cnt <= r;
}
bool check(string &t) {
  bool ok = true;
  for (int i = 0; i < (q); i++) {
    if (LUL(t, req_save[i].first, req_save[i].second.first,
            req_save[i].second.second))
      continue;
    ok = false;
    break;
  }
  return ok;
}
void solve() {
  cin >> s >> q;
  req_save = vector<pair<string, ii>>(q);
  for (int i = 0; i < (q); i++) {
    cin >> req_save[i].first >> req_save[i].second.first >>
        req_save[i].second.second;
  }
  for (int i = 0; i < (s.size()); i++) {
    for (int j = i; j < (s.size()); j++) {
      string r = "";
      for (int k = i; k < (j + 1); k++) r += s[k];
      if (check(r)) {
        ans.insert(r);
      }
    }
  }
  cout << ans.size() << endl;
}

```