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 sam {
  int t, f, l, x[27];
} t[600005 * 2];
int last, S, N, L[15], R[15], b[600005 * 2], q[600005 * 2], s[600005 * 2][15];
char a[600005];
void add(int c, int d) {
  int p = last, q, r, u = ++S;
  last = u, t[u].l = t[p].l + 1;
  if (d > -1) s[u][d]++;
  for (; p && !t[p].x[c]; p = t[p].f) t[p].x[c] = u;
  if (!p)
    t[u].f = 1;
  else if (t[q = t[p].x[c]].l == t[p].l + 1)
    t[u].f = q;
  else {
    t[r = ++S] = t[q], t[r].l = t[p].l + 1, t[u].f = t[q].f = r;
    for (; p && t[p].x[c] == q; p = t[p].f) t[p].x[c] = r;
  }
}
void add(char* s, int d) {
  for (int i = 0; s[i]; i++) add(s[i] - 97, d);
  add(26, -1);
}
void init() {
  last = ++S, scanf("%s%d", a, &N), add(a, 0);
  for (int i = 1; i <= N; i++) scanf("%s%d%d", a, &L[i], &R[i]), add(a, i);
}
void doit() {
  long long ans = 0;
  for (int i = 1; i <= S; i++) b[t[i].l]++;
  for (int i = 1; i <= S; i++) b[i] += b[i - 1];
  for (int i = S; i; i--) q[b[t[i].l]--] = i;
  for (int x = S, i; i = q[x], x; x--) {
    for (int j = 0; j <= N; j++) s[t[i].f][j] += s[i][j];
    bool ok = s[i][0];
    for (int j = 1; ok && j <= N; j++)
      if (s[i][j] < L[j] || s[i][j] > R[j]) ok = 0;
    if (ok) ans += t[i].l - t[t[i].f].l;
  }
  cout << ans << endl;
}
int main() {
  init();
  doit();
  return 0;
}
