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.
#include <bits/stdc++.h>
using namespace std;
struct node {
  int p[26], cnt, bad, f;
} T[2000005];
int n, m, nd, q[2000005], lo, hi;
char s[2005], rule[2005];
int ret = 0;
void add(char s[]) {
  int x = 0, c;
  for (int i = 0; s[i]; i++) {
    c = s[i] - 'a';
    if (!T[x].p[c]) T[x].p[c] = nd, ++nd;
    x = T[x].p[c];
  }
}
void build() {
  int x, y, t;
  q[0] = 0;
  T[0].f = -1;
  for (int i = 0, j = 0; j >= i; i++) {
    x = q[i];
    for (int k = 0; k < 26; k++) {
      y = T[x].p[k];
      if (y) {
        t = T[x].f;
        while (t >= 0 && !T[t].p[k]) t = T[t].f;
        if (t < 0)
          T[y].f = 0;
        else
          T[y].f = T[t].p[k];
        q[++j] = y;
      }
    }
  }
}
void match(char s[]) {
  int x = 0, c, t;
  for (int i = 0; s[i]; i++) {
    c = s[i] - 'a';
    while (x > 0 && !T[x].p[c]) x = T[x].f;
    x = T[x].p[c];
    t = x;
    while (t > 0) {
      T[t].cnt++;
      t = T[t].f;
    }
  }
}
int main() {
  scanf("%s", s), n = strlen(s);
  nd = 1;
  for (int i = (0); i < (n); i++) add(s + i);
  build();
  scanf("%d", &m);
  for (int i = (0); i < (m); i++) {
    scanf("%s%d%d", rule, &lo, &hi);
    for (int j = (0); j < (nd); j++) T[j].cnt = 0;
    match(rule);
    for (int j = (0); j < (nd); j++)
      if (T[j].cnt < lo || T[j].cnt > hi) T[j].bad = 1;
  }
  for (int i = (1); i < (nd); i++) ret += 1 - T[i].bad;
  printf("%d\n", ret);
  return 0;
}
