#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 50000;
queue<int> q;
char str[MAX_N + 10];
map<char, int> f[MAX_N * 11 * 2 + 30];
int cnt[MAX_N * 11 * 2 + 30][15];
long long g[MAX_N * 11 * 2 + 30];
int totLen;
int fa[MAX_N * 11 * 2 + 30], dep[MAX_N * 11 * 2 + 30];
int len, slen[15];
int le[15], ri[15], last, n;
int low[15], up[15];
int tn, deg[MAX_N * 11 * 2 + 30];
int seq[MAX_N * 11 * 2 + 30], sn;
void insert(char c, int id) {
  int u = ++tn;
  dep[u] = dep[last] + 1;
  ++cnt[u][id];
  int cur;
  for (cur = last; cur != -1 && f[cur].find(c) == f[cur].end(); cur = fa[cur])
    f[cur][c] = u;
  if (cur == -1)
    fa[u] = 0;
  else {
    int q = f[cur][c];
    if (dep[q] == dep[cur] + 1)
      fa[u] = q;
    else {
      int v = ++tn;
      dep[v] = dep[cur] + 1;
      fa[v] = fa[q];
      f[v] = f[q];
      fa[q] = fa[u] = v;
      for (; cur != -1 && f[cur][c] == q; cur = fa[cur]) f[cur][c] = v;
    }
  }
  last = u;
}
int main() {
  fa[0] = -1;
  scanf("%s", str + 1);
  scanf("%d", &n);
  len = strlen(str + 1);
  for (int i = 1; i <= len; i++) insert(str[i], n + 1);
  insert('#', 0);
  for (int i = 1; i <= n; i++) {
    scanf("%s%d%d", str + 1, low + i, up + i);
    slen[i] = strlen(str + 1);
    le[i] = totLen + 1;
    for (int j = 1; j <= slen[i]; j++) insert(str[j], i);
    ri[i] = totLen;
    insert('#', 0);
  }
  for (int i = 1; i <= tn; i++) ++deg[fa[i]];
  for (int i = 0; i <= tn; i++)
    if (deg[i] == 0) q.push(i);
  while (!q.empty()) {
    int cur = q.front();
    q.pop();
    seq[++sn] = cur;
    if (cur == 0) continue;
    --deg[fa[cur]];
    if (deg[fa[cur]] == 0) q.push(fa[cur]);
  }
  for (int i = 1; i <= sn; i++) {
    int cur = seq[i];
    if (cur == 0) continue;
    for (int j = 1; j <= n + 1; j++) cnt[fa[cur]][j] += cnt[cur][j];
  }
  for (int i = 0; i <= tn; i++)
    for (map<char, int>::iterator it = f[i].begin(); it != f[i].end(); it++)
      ++deg[it->second];
  for (int i = 0; i <= tn; i++)
    if (!deg[i]) q.push(i);
  sn = 0;
  while (!q.empty()) {
    int cur = q.front();
    q.pop();
    seq[++sn] = cur;
    for (map<char, int>::iterator it = f[cur].begin(); it != f[cur].end();
         it++) {
      --deg[it->second];
      if (deg[it->second] == 0) q.push(it->second);
    }
  }
  g[0] = 1;
  for (int i = 1; i <= sn; i++) {
    int cur = seq[i];
    for (map<char, int>::iterator it = f[cur].begin(); it != f[cur].end(); it++)
      g[it->second] += g[cur];
  }
  long long ans = 0;
  for (int i = 1; i <= tn; i++) {
    if (cnt[i][n + 1] == 0) continue;
    bool flag = true;
    for (int j = 1; j <= n; j++)
      if (cnt[i][j] < low[j] || cnt[i][j] > up[j]) {
        flag = false;
        break;
      }
    if (flag) ans += g[i];
  }
  printf(
      "%I64d"
      "\n",
      ans);
  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;
const int MAX_N = 50000;
queue<int> q;
char str[MAX_N + 10];
map<char, int> f[MAX_N * 11 * 2 + 30];
int cnt[MAX_N * 11 * 2 + 30][15];
long long g[MAX_N * 11 * 2 + 30];
int totLen;
int fa[MAX_N * 11 * 2 + 30], dep[MAX_N * 11 * 2 + 30];
int len, slen[15];
int le[15], ri[15], last, n;
int low[15], up[15];
int tn, deg[MAX_N * 11 * 2 + 30];
int seq[MAX_N * 11 * 2 + 30], sn;
void insert(char c, int id) {
  int u = ++tn;
  dep[u] = dep[last] + 1;
  ++cnt[u][id];
  int cur;
  for (cur = last; cur != -1 && f[cur].find(c) == f[cur].end(); cur = fa[cur])
    f[cur][c] = u;
  if (cur == -1)
    fa[u] = 0;
  else {
    int q = f[cur][c];
    if (dep[q] == dep[cur] + 1)
      fa[u] = q;
    else {
      int v = ++tn;
      dep[v] = dep[cur] + 1;
      fa[v] = fa[q];
      f[v] = f[q];
      fa[q] = fa[u] = v;
      for (; cur != -1 && f[cur][c] == q; cur = fa[cur]) f[cur][c] = v;
    }
  }
  last = u;
}
int main() {
  fa[0] = -1;
  scanf("%s", str + 1);
  scanf("%d", &n);
  len = strlen(str + 1);
  for (int i = 1; i <= len; i++) insert(str[i], n + 1);
  insert('#', 0);
  for (int i = 1; i <= n; i++) {
    scanf("%s%d%d", str + 1, low + i, up + i);
    slen[i] = strlen(str + 1);
    le[i] = totLen + 1;
    for (int j = 1; j <= slen[i]; j++) insert(str[j], i);
    ri[i] = totLen;
    insert('#', 0);
  }
  for (int i = 1; i <= tn; i++) ++deg[fa[i]];
  for (int i = 0; i <= tn; i++)
    if (deg[i] == 0) q.push(i);
  while (!q.empty()) {
    int cur = q.front();
    q.pop();
    seq[++sn] = cur;
    if (cur == 0) continue;
    --deg[fa[cur]];
    if (deg[fa[cur]] == 0) q.push(fa[cur]);
  }
  for (int i = 1; i <= sn; i++) {
    int cur = seq[i];
    if (cur == 0) continue;
    for (int j = 1; j <= n + 1; j++) cnt[fa[cur]][j] += cnt[cur][j];
  }
  for (int i = 0; i <= tn; i++)
    for (map<char, int>::iterator it = f[i].begin(); it != f[i].end(); it++)
      ++deg[it->second];
  for (int i = 0; i <= tn; i++)
    if (!deg[i]) q.push(i);
  sn = 0;
  while (!q.empty()) {
    int cur = q.front();
    q.pop();
    seq[++sn] = cur;
    for (map<char, int>::iterator it = f[cur].begin(); it != f[cur].end();
         it++) {
      --deg[it->second];
      if (deg[it->second] == 0) q.push(it->second);
    }
  }
  g[0] = 1;
  for (int i = 1; i <= sn; i++) {
    int cur = seq[i];
    for (map<char, int>::iterator it = f[cur].begin(); it != f[cur].end(); it++)
      g[it->second] += g[cur];
  }
  long long ans = 0;
  for (int i = 1; i <= tn; i++) {
    if (cnt[i][n + 1] == 0) continue;
    bool flag = true;
    for (int j = 1; j <= n; j++)
      if (cnt[i][j] < low[j] || cnt[i][j] > up[j]) {
        flag = false;
        break;
      }
    if (flag) ans += g[i];
  }
  printf(
      "%I64d"
      "\n",
      ans);
  return 0;
}

```