#include <bits/stdc++.h>
using namespace std;
const int maxl = 2048;
const int maxn = 10;
vector<string> ret;
char buf[maxl];
char str[maxn][maxl];
int L[maxn], nxt[maxl];
int l[maxn], r[maxn];
int n;
bool check(string& s) {
  nxt[0] = -1;
  int k = -1;
  for (int i = 1; i < s.size(); ++i) {
    while (k != -1 && s[k + 1] != s[i]) k = nxt[k];
    if (s[k + 1] == s[i]) ++k;
    nxt[i] = k;
  }
  for (int i = 0; i < n; ++i) {
    int res = 0, k = -1;
    for (int j = 0; j < L[i]; ++j) {
      while (k != -1 && s[k + 1] != str[i][j]) k = nxt[k];
      if (s[k + 1] == str[i][j]) ++k;
      if (k + 1 == s.size()) {
        ++res;
        k = nxt[k];
      }
    }
    if (res >= l[i] && res <= r[i])
      ;
    else
      return false;
  }
  return true;
}
int main() {
  scanf("%s", buf);
  int len = strlen(buf);
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s", str[i]);
    L[i] = strlen(str[i]);
    scanf("%d %d", &l[i], &r[i]);
  }
  int result = 0;
  for (int l = 1; l <= len; ++l) {
    ret.clear();
    for (int ed = l; ed <= len; ++ed) {
      char tmp = buf[ed];
      buf[ed] = 0;
      ret.push_back(buf + ed - l);
      buf[ed] = tmp;
    }
    sort(ret.begin(), ret.end());
    int tn = unique(ret.begin(), ret.end()) - ret.begin();
    for (int i = 0; i < tn; ++i) {
      if (check(ret[i])) ++result;
    }
  }
  cout << result << endl;
  return 0;
}

### Prompt

Your task is to create 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 maxl = 2048;
const int maxn = 10;
vector<string> ret;
char buf[maxl];
char str[maxn][maxl];
int L[maxn], nxt[maxl];
int l[maxn], r[maxn];
int n;
bool check(string& s) {
  nxt[0] = -1;
  int k = -1;
  for (int i = 1; i < s.size(); ++i) {
    while (k != -1 && s[k + 1] != s[i]) k = nxt[k];
    if (s[k + 1] == s[i]) ++k;
    nxt[i] = k;
  }
  for (int i = 0; i < n; ++i) {
    int res = 0, k = -1;
    for (int j = 0; j < L[i]; ++j) {
      while (k != -1 && s[k + 1] != str[i][j]) k = nxt[k];
      if (s[k + 1] == str[i][j]) ++k;
      if (k + 1 == s.size()) {
        ++res;
        k = nxt[k];
      }
    }
    if (res >= l[i] && res <= r[i])
      ;
    else
      return false;
  }
  return true;
}
int main() {
  scanf("%s", buf);
  int len = strlen(buf);
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s", str[i]);
    L[i] = strlen(str[i]);
    scanf("%d %d", &l[i], &r[i]);
  }
  int result = 0;
  for (int l = 1; l <= len; ++l) {
    ret.clear();
    for (int ed = l; ed <= len; ++ed) {
      char tmp = buf[ed];
      buf[ed] = 0;
      ret.push_back(buf + ed - l);
      buf[ed] = tmp;
    }
    sort(ret.begin(), ret.end());
    int tn = unique(ret.begin(), ret.end()) - ret.begin();
    for (int i = 0; i < tn; ++i) {
      if (check(ret[i])) ++result;
    }
  }
  cout << result << endl;
  return 0;
}

```