#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 100000000;
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
map<unsigned long long, string> to_sh(const string& s) {
  map<unsigned long long, string> mp;
  for (int i = 0; i < (((int)(s).size())); i++) {
    unsigned long long h = 0;
    string c;
    for (int j = i; j < ((int)(s).size()); j++) {
      h = s[j] + h * (unsigned long long)MOD;
      c.push_back(s[j]);
      mp[h] = s[j];
    }
  }
  return mp;
}
vector<unsigned long long> to_hash(const string& s) {
  vector<unsigned long long> mp;
  for (int i = 0; i < (((int)(s).size())); i++) {
    unsigned long long h = 0;
    for (int j = i; j < ((int)(s).size()); j++) {
      h = s[j] + h * (unsigned long long)MOD;
      mp.push_back(h);
    }
  }
  sort(mp.begin(), mp.end());
  return mp;
}
int cont(vector<unsigned long long>& con, unsigned long long cur) {
  pair<vector<unsigned long long>::iterator,
       vector<unsigned long long>::iterator>
      e = equal_range(con.begin(), con.end(), cur);
  return e.second - e.first;
}
int main() {
  string s;
  int n;
  cin >> s >> n;
  vector<unsigned long long> sh = to_hash(s);
  sh.erase(unique(sh.begin(), sh.end()), sh.end());
  for (int i = 0; i < (n); i++) {
    string p;
    int l, r;
    cin >> p >> l >> r;
    vector<unsigned long long> new_sh, psh = to_hash(p);
    for (vector<unsigned long long>::iterator it = sh.begin(); it != sh.end();
         ++it) {
      int c = cont(psh, *it);
      if (l <= c && c <= r) new_sh.push_back(*it);
    }
    sh.swap(new_sh);
  }
  cout << ((int)(sh).size()) << endl;
  return 0;
}

### Prompt

Create a solution in CPP for 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 MOD = 1000000007;
const int INF = 100000000;
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
map<unsigned long long, string> to_sh(const string& s) {
  map<unsigned long long, string> mp;
  for (int i = 0; i < (((int)(s).size())); i++) {
    unsigned long long h = 0;
    string c;
    for (int j = i; j < ((int)(s).size()); j++) {
      h = s[j] + h * (unsigned long long)MOD;
      c.push_back(s[j]);
      mp[h] = s[j];
    }
  }
  return mp;
}
vector<unsigned long long> to_hash(const string& s) {
  vector<unsigned long long> mp;
  for (int i = 0; i < (((int)(s).size())); i++) {
    unsigned long long h = 0;
    for (int j = i; j < ((int)(s).size()); j++) {
      h = s[j] + h * (unsigned long long)MOD;
      mp.push_back(h);
    }
  }
  sort(mp.begin(), mp.end());
  return mp;
}
int cont(vector<unsigned long long>& con, unsigned long long cur) {
  pair<vector<unsigned long long>::iterator,
       vector<unsigned long long>::iterator>
      e = equal_range(con.begin(), con.end(), cur);
  return e.second - e.first;
}
int main() {
  string s;
  int n;
  cin >> s >> n;
  vector<unsigned long long> sh = to_hash(s);
  sh.erase(unique(sh.begin(), sh.end()), sh.end());
  for (int i = 0; i < (n); i++) {
    string p;
    int l, r;
    cin >> p >> l >> r;
    vector<unsigned long long> new_sh, psh = to_hash(p);
    for (vector<unsigned long long>::iterator it = sh.begin(); it != sh.end();
         ++it) {
      int c = cont(psh, *it);
      if (l <= c && c <= r) new_sh.push_back(*it);
    }
    sh.swap(new_sh);
  }
  cout << ((int)(sh).size()) << endl;
  return 0;
}

```