#include <bits/stdc++.h>
using namespace std;
vector<int> z_function(string s) {
  int n = (int)s.length();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
struct node {
  bool leaf;
  int next[26];
};
const int nMax = 100000;
node bor[nMax];
int sz = 0;
vector<string> p;
vector<pair<int, int> > c;
void add_string(string& str) {
  int v = 0;
  for (size_t i = 0; i < str.length(); ++i) {
    char c = str[i] - 'a';
    if (bor[v].next[c] == -1) {
      memset(bor[sz].next, 255, sizeof bor[sz].next);
      bor[v].next[c] = sz++;
    }
    v = bor[v].next[c];
  }
  bor[v].leaf = true;
}
bool check(string& str) {
  bool ans = true;
  for (int i = 0; i < p.size(); ++i) {
    string tmp = str + "#" + p[i];
    vector<int> z = z_function(tmp);
    int cnt = 0;
    for (int j = str.size() + 1; j < z.size(); ++j) {
      cnt += (z[j] == str.size());
    }
    if (cnt < c[i].first || cnt > c[i].second) ans = false;
  }
  return ans;
}
int total = 0;
void dfs(int v, string str) {
  if (str != "") total += check(str);
  for (int i = 0; i < 26; ++i) {
    int to = bor[v].next[i];
    if (to != -1) {
      char ch = i + 'a';
      string s = str + ch;
      dfs(to, s);
    }
  }
}
int main() {
  string s;
  cin >> s;
  int n;
  cin >> n;
  p.resize(n);
  c.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> p[i];
    int l, r;
    cin >> l >> r;
    c[i] = make_pair(l, r);
  }
  memset(bor[0].next, 255, sizeof bor[0].next);
  sz = 1;
  string str = "";
  for (int i = s.size() - 1; i >= 0; --i) {
    str.insert(0, 1, s[i]);
    add_string(str);
  }
  string all;
  dfs(0, all);
  cout << total << 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;
vector<int> z_function(string s) {
  int n = (int)s.length();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
struct node {
  bool leaf;
  int next[26];
};
const int nMax = 100000;
node bor[nMax];
int sz = 0;
vector<string> p;
vector<pair<int, int> > c;
void add_string(string& str) {
  int v = 0;
  for (size_t i = 0; i < str.length(); ++i) {
    char c = str[i] - 'a';
    if (bor[v].next[c] == -1) {
      memset(bor[sz].next, 255, sizeof bor[sz].next);
      bor[v].next[c] = sz++;
    }
    v = bor[v].next[c];
  }
  bor[v].leaf = true;
}
bool check(string& str) {
  bool ans = true;
  for (int i = 0; i < p.size(); ++i) {
    string tmp = str + "#" + p[i];
    vector<int> z = z_function(tmp);
    int cnt = 0;
    for (int j = str.size() + 1; j < z.size(); ++j) {
      cnt += (z[j] == str.size());
    }
    if (cnt < c[i].first || cnt > c[i].second) ans = false;
  }
  return ans;
}
int total = 0;
void dfs(int v, string str) {
  if (str != "") total += check(str);
  for (int i = 0; i < 26; ++i) {
    int to = bor[v].next[i];
    if (to != -1) {
      char ch = i + 'a';
      string s = str + ch;
      dfs(to, s);
    }
  }
}
int main() {
  string s;
  cin >> s;
  int n;
  cin >> n;
  p.resize(n);
  c.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> p[i];
    int l, r;
    cin >> l >> r;
    c[i] = make_pair(l, r);
  }
  memset(bor[0].next, 255, sizeof bor[0].next);
  sz = 1;
  string str = "";
  for (int i = s.size() - 1; i >= 0; --i) {
    str.insert(0, 1, s[i]);
    add_string(str);
  }
  string all;
  dfs(0, all);
  cout << total << endl;
  return 0;
}

```