#include <bits/stdc++.h>
using namespace std;
const int Maxn = 3005, Maxm = 100005, Mo = 1000000000;
const long long oo = LLONG_MAX >> 1;
struct Tree {
  int l, r;
};
struct edge {
  int v, c, nt;
};
struct point {
  long long x, y;
};
typedef int IArr[Maxn];
typedef long long LArr[Maxn];
typedef double DArr[Maxn];
int i, j, k, n, m, stlen;
IArr l, r, cnt[15], nxt, len, nt[15], P;
char s[15][Maxn];
char st[Maxn];
string now;
int KMP(int l, int r, int k) {
  char tt[Maxn];
  for (int i = 0; i < now.size(); i++) tt[i + 1] = now[i];
  tt[r - l + 2] = '\0';
  nxt[1] = 0;
  int j = 0;
  for (int i = 2; i <= r - l + 1; i++) {
    while (j && tt[j + 1] != tt[i]) j = nxt[j];
    if (tt[j + 1] == tt[i]) j++;
    nxt[i] = j;
  }
  int sum = 0;
  j = 0;
  for (int i = 1; i <= len[k]; i++) {
    while (j && tt[j + 1] != s[k][i]) j = nxt[j];
    if (tt[j + 1] == s[k][i]) j++;
    if (j == r - l + 1) {
      sum++;
      j = nxt[j];
    }
  }
  return sum;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> st + 1;
  cin >> n;
  stlen = (int)strlen(st + 1);
  for (i = 1; i <= n; i++) {
    cin >> s[i] + 1;
    cin >> l[i] >> r[i];
    len[i] = (int)strlen(s[i] + 1);
  }
  int ans = 0;
  map<string, int> mp;
  for (int i = 1; i <= stlen; i++) {
    now.clear();
    for (int j = i; j <= stlen; j++) {
      now.push_back((st[j]));
      int can = 1;
      for (int k = 1; k <= n; k++) {
        int sum = KMP(i, j, k);
        can = can && sum >= l[k] && sum <= r[k];
        if (!can) break;
      }
      if (can && mp[now] == 0) {
        mp[now] = 1;
        ans++;
      }
    }
  }
  cout << ans << endl;
}

### 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 Maxn = 3005, Maxm = 100005, Mo = 1000000000;
const long long oo = LLONG_MAX >> 1;
struct Tree {
  int l, r;
};
struct edge {
  int v, c, nt;
};
struct point {
  long long x, y;
};
typedef int IArr[Maxn];
typedef long long LArr[Maxn];
typedef double DArr[Maxn];
int i, j, k, n, m, stlen;
IArr l, r, cnt[15], nxt, len, nt[15], P;
char s[15][Maxn];
char st[Maxn];
string now;
int KMP(int l, int r, int k) {
  char tt[Maxn];
  for (int i = 0; i < now.size(); i++) tt[i + 1] = now[i];
  tt[r - l + 2] = '\0';
  nxt[1] = 0;
  int j = 0;
  for (int i = 2; i <= r - l + 1; i++) {
    while (j && tt[j + 1] != tt[i]) j = nxt[j];
    if (tt[j + 1] == tt[i]) j++;
    nxt[i] = j;
  }
  int sum = 0;
  j = 0;
  for (int i = 1; i <= len[k]; i++) {
    while (j && tt[j + 1] != s[k][i]) j = nxt[j];
    if (tt[j + 1] == s[k][i]) j++;
    if (j == r - l + 1) {
      sum++;
      j = nxt[j];
    }
  }
  return sum;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> st + 1;
  cin >> n;
  stlen = (int)strlen(st + 1);
  for (i = 1; i <= n; i++) {
    cin >> s[i] + 1;
    cin >> l[i] >> r[i];
    len[i] = (int)strlen(s[i] + 1);
  }
  int ans = 0;
  map<string, int> mp;
  for (int i = 1; i <= stlen; i++) {
    now.clear();
    for (int j = i; j <= stlen; j++) {
      now.push_back((st[j]));
      int can = 1;
      for (int k = 1; k <= n; k++) {
        int sum = KMP(i, j, k);
        can = can && sum >= l[k] && sum <= r[k];
        if (!can) break;
      }
      if (can && mp[now] == 0) {
        mp[now] = 1;
        ans++;
      }
    }
  }
  cout << ans << endl;
}

```