#include <bits/stdc++.h>
using namespace std;
int _;
const int MAXN = 2002;
const int MAXCNT = (MAXN * MAXN) / 2;
string s;
int ocur[MAXCNT];
int num[MAXCNT];
int nxt[MAXCNT][26];
int cnt = 1;
int n;
void AddTrie(string str, int val, int l, int r) {
  int cur = 0;
  for (int i = 0; i < ((int)(str).size()); ++i) {
    int x = nxt[cur][str[i] - 'a'];
    if (x == 0) {
      if (val) break;
      x = nxt[cur][str[i] - 'a'] = cnt++;
    }
    cur = x;
    if (val) {
      ocur[cur] += val;
      if (ocur[cur] == r + 1) --num[cur];
      if (ocur[cur] == l) ++num[cur];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> s;
  for (__typeof(((int)(s).size())) i = (0); i < (((int)(s).size())); ++i)
    AddTrie(s.substr(i), 0, 0, 0);
  cin >> n;
  for (__typeof(n) i = (0); i < (n); ++i) {
    memset(ocur, 0, sizeof(ocur));
    string p;
    int l, r;
    cin >> p >> l >> r;
    if (l == 0) {
      for (int j = 1; j < cnt; ++j) ++num[j];
    }
    for (int i = 0; i < ((int)(p).size()); ++i) {
      AddTrie(p.substr(i), 1, l, r);
    }
  }
  int ans = 0;
  for (int i = 1; i < cnt; ++i)
    if (num[i] == n) ++ans;
  cout << ans << endl;
  return 0;
}

### Prompt

In CPP, your task is to solve 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;
int _;
const int MAXN = 2002;
const int MAXCNT = (MAXN * MAXN) / 2;
string s;
int ocur[MAXCNT];
int num[MAXCNT];
int nxt[MAXCNT][26];
int cnt = 1;
int n;
void AddTrie(string str, int val, int l, int r) {
  int cur = 0;
  for (int i = 0; i < ((int)(str).size()); ++i) {
    int x = nxt[cur][str[i] - 'a'];
    if (x == 0) {
      if (val) break;
      x = nxt[cur][str[i] - 'a'] = cnt++;
    }
    cur = x;
    if (val) {
      ocur[cur] += val;
      if (ocur[cur] == r + 1) --num[cur];
      if (ocur[cur] == l) ++num[cur];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> s;
  for (__typeof(((int)(s).size())) i = (0); i < (((int)(s).size())); ++i)
    AddTrie(s.substr(i), 0, 0, 0);
  cin >> n;
  for (__typeof(n) i = (0); i < (n); ++i) {
    memset(ocur, 0, sizeof(ocur));
    string p;
    int l, r;
    cin >> p >> l >> r;
    if (l == 0) {
      for (int j = 1; j < cnt; ++j) ++num[j];
    }
    for (int i = 0; i < ((int)(p).size()); ++i) {
      AddTrie(p.substr(i), 1, l, r);
    }
  }
  int ans = 0;
  for (int i = 1; i < cnt; ++i)
    if (num[i] == n) ++ans;
  cout << ans << endl;
  return 0;
}

```