#include <bits/stdc++.h>
using namespace std;
const int N = 2e2 + 7;
const int B = 23333;
const int MOD = 1e9 + 7;
int pw[N];
int n, m;
int qpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
struct H {
  static const int N = ::N;
  int pre[N];
  void build(char *str, int len = -1) {
    if (!~len) len = strlen(str);
    pre[0] = str[0];
    for (int i = (1); i < (len); i++)
      pre[i] = (str[i] + 1ll * pre[i - 1] * B) % MOD;
  }
  int gao(int l, int r) {
    return (pre[r] - 1ll * (l > 0 ? pre[l - 1] : 0) * pw[r - l + 1] % MOD +
            MOD) %
           MOD;
  }
};
struct Rule {
  char str[N];
  int liml, limr;
  H h;
  int strn;
  void read() {
    scanf(" %s%d%d", str, &liml, &limr);
    h.build(str, strn = strlen(str));
  }
  bool gao(int hval, int len) {
    int ret = 0;
    for (int l = (0); l < (strn + 1 - len); l++) {
      int r = l + len - 1;
      if (h.gao(l, r) == hval) ret++;
    }
    return ret >= liml && ret <= limr;
  }
} rule[N];
char str[N];
int main() {
  pw[0] = 1;
  for (int i = (1); i < (N); i++) pw[i] = 1ll * pw[i - 1] * B % MOD;
  scanf(" %s", str);
  int len = strlen(str);
  cin >> m;
  for (int i = (0); i < (m); i++) rule[i].read();
  H h;
  h.build(str, len);
  vector<int> ans;
  for (int i = (1); i < (len + 1); i++) {
    for (int l = (0); l < (len + 1 - i); l++) {
      bool ok = true;
      int r = l + i - 1;
      int hval = h.gao(l, r);
      for (int j = (0); j < (m); j++)
        if (!rule[j].gao(hval, i)) {
          ok = false;
          break;
        }
      if (ok) ans.push_back(hval);
    }
  }
  sort((ans).begin(), (ans).end());
  ans.erase(unique((ans).begin(), (ans).end()), ans.end());
  printf("%d\n", ((int)(ans).size()));
  return 0;
}

### 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;
const int N = 2e2 + 7;
const int B = 23333;
const int MOD = 1e9 + 7;
int pw[N];
int n, m;
int qpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
struct H {
  static const int N = ::N;
  int pre[N];
  void build(char *str, int len = -1) {
    if (!~len) len = strlen(str);
    pre[0] = str[0];
    for (int i = (1); i < (len); i++)
      pre[i] = (str[i] + 1ll * pre[i - 1] * B) % MOD;
  }
  int gao(int l, int r) {
    return (pre[r] - 1ll * (l > 0 ? pre[l - 1] : 0) * pw[r - l + 1] % MOD +
            MOD) %
           MOD;
  }
};
struct Rule {
  char str[N];
  int liml, limr;
  H h;
  int strn;
  void read() {
    scanf(" %s%d%d", str, &liml, &limr);
    h.build(str, strn = strlen(str));
  }
  bool gao(int hval, int len) {
    int ret = 0;
    for (int l = (0); l < (strn + 1 - len); l++) {
      int r = l + len - 1;
      if (h.gao(l, r) == hval) ret++;
    }
    return ret >= liml && ret <= limr;
  }
} rule[N];
char str[N];
int main() {
  pw[0] = 1;
  for (int i = (1); i < (N); i++) pw[i] = 1ll * pw[i - 1] * B % MOD;
  scanf(" %s", str);
  int len = strlen(str);
  cin >> m;
  for (int i = (0); i < (m); i++) rule[i].read();
  H h;
  h.build(str, len);
  vector<int> ans;
  for (int i = (1); i < (len + 1); i++) {
    for (int l = (0); l < (len + 1 - i); l++) {
      bool ok = true;
      int r = l + i - 1;
      int hval = h.gao(l, r);
      for (int j = (0); j < (m); j++)
        if (!rule[j].gao(hval, i)) {
          ok = false;
          break;
        }
      if (ok) ans.push_back(hval);
    }
  }
  sort((ans).begin(), (ans).end());
  ans.erase(unique((ans).begin(), (ans).end()), ans.end());
  printf("%d\n", ((int)(ans).size()));
  return 0;
}

```