#include <bits/stdc++.h>
using namespace std;
const int p = 97;
const int mod = 1097774749;
char s[50100];
int n;
set<int> good[20];
set<int> all[20];
char tmp[50100];
long long pp[50100];
long long ha[50100];
int ai[20], bi[20];
inline int g(long long x) {
  x %= mod;
  if (x < 0) x += mod;
  return x;
}
int main() {
  pp[0] = 1;
  for (int i = (1); i <= (50000); i++) pp[i] = (pp[i - 1] * p) % mod;
  scanf("%s", s);
  scanf("%d", &n);
  for (int v = 0; v < (n); v++) {
    map<int, int> XD;
    scanf("%s", tmp);
    int a, b;
    scanf("%d%d", &a, &b);
    ai[v] = a;
    bi[v] = b;
    ha[0] = 0;
    int l = strlen(tmp);
    for (int i = 0; i < (l); i++) {
      ha[i + 1] = (ha[i] * p + tmp[i] - 'a' + 7) % mod;
    }
    for (int i = 0; i < (l); i++)
      for (int j = (0); j <= (i); j++) {
        int hh = g(ha[i + 1] - ha[j] * pp[i - j + 1]);
        XD[hh]++;
      }
    for (__typeof((XD).begin()) it = (XD).begin(); it != (XD).end(); it++) {
      if (it->second >= a && it->second <= b) {
        good[v].insert(it->first);
      }
      all[v].insert(it->first);
    }
  }
  int l = strlen(s);
  ha[0] = 0;
  for (int i = 0; i < (l); i++) {
    ha[i + 1] = (ha[i] * p + s[i] - 'a' + 7) % mod;
  }
  set<int> ans;
  for (int i = 0; i < (l); i++)
    for (int j = (0); j <= (i); j++) {
      int hh = g(ha[i + 1] - ha[j] * pp[i - j + 1]);
      bool f = 1;
      int kk;
      for (int k = 0; k < (n); k++) {
        kk = k;
        if (ai[k] == 0 && !all[k].count(hh)) continue;
        if (!good[k].count(hh)) {
          f = 0;
          break;
        }
      }
      if (f) ans.insert(hh);
    }
  printf("%d\n", ans.size());
}

### Prompt

Please formulate 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;
const int p = 97;
const int mod = 1097774749;
char s[50100];
int n;
set<int> good[20];
set<int> all[20];
char tmp[50100];
long long pp[50100];
long long ha[50100];
int ai[20], bi[20];
inline int g(long long x) {
  x %= mod;
  if (x < 0) x += mod;
  return x;
}
int main() {
  pp[0] = 1;
  for (int i = (1); i <= (50000); i++) pp[i] = (pp[i - 1] * p) % mod;
  scanf("%s", s);
  scanf("%d", &n);
  for (int v = 0; v < (n); v++) {
    map<int, int> XD;
    scanf("%s", tmp);
    int a, b;
    scanf("%d%d", &a, &b);
    ai[v] = a;
    bi[v] = b;
    ha[0] = 0;
    int l = strlen(tmp);
    for (int i = 0; i < (l); i++) {
      ha[i + 1] = (ha[i] * p + tmp[i] - 'a' + 7) % mod;
    }
    for (int i = 0; i < (l); i++)
      for (int j = (0); j <= (i); j++) {
        int hh = g(ha[i + 1] - ha[j] * pp[i - j + 1]);
        XD[hh]++;
      }
    for (__typeof((XD).begin()) it = (XD).begin(); it != (XD).end(); it++) {
      if (it->second >= a && it->second <= b) {
        good[v].insert(it->first);
      }
      all[v].insert(it->first);
    }
  }
  int l = strlen(s);
  ha[0] = 0;
  for (int i = 0; i < (l); i++) {
    ha[i + 1] = (ha[i] * p + s[i] - 'a' + 7) % mod;
  }
  set<int> ans;
  for (int i = 0; i < (l); i++)
    for (int j = (0); j <= (i); j++) {
      int hh = g(ha[i + 1] - ha[j] * pp[i - j + 1]);
      bool f = 1;
      int kk;
      for (int k = 0; k < (n); k++) {
        kk = k;
        if (ai[k] == 0 && !all[k].count(hh)) continue;
        if (!good[k].count(hh)) {
          f = 0;
          break;
        }
      }
      if (f) ans.insert(hh);
    }
  printf("%d\n", ans.size());
}

```