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>
const int N = 1000000;
int ch[N][27], len[N], cnt[N][11], fail[N];
int tail, tot, root;
void extend(int c, int id = -1) {
  int p = tail;
  tail = ++tot;
  len[tail] = len[p] + 1;
  if (~id) cnt[tail][id] = 1;
  while (~p && !ch[p][c]) ch[p][c] = tail, p = fail[p];
  if (p == -1) {
    fail[tail] = root;
  } else if (len[ch[p][c]] + 1 == len[p]) {
    fail[tail] = ch[p][c];
  } else {
    len[++tot] = len[p] + 1;
    int tmp = ch[p][c];
    memcpy(ch[tot], ch[tmp], sizeof ch[tmp]);
    fail[tot] = fail[tmp];
    fail[tmp] = fail[tail] = tot;
    while (~p && ch[p][c] == tmp) ch[p][c] = tot, p = fail[p];
  }
}
char buf[N];
std::vector<int> G[N];
int answer, n;
int L[N], R[N];
void dfs(int u) {
  for (int _ = 0; _ < G[u].size(); _++) {
    int v = G[u][_];
    dfs(v);
    for (int i = 0; i < n + 1; i++) cnt[u][i] += cnt[v][i];
  }
  bool can = true;
  for (int i = 0; i < n; i++) {
    if (L[i] > cnt[u][i + 1] || cnt[u][i + 1] > R[i]) can = false;
  }
  if (can && cnt[u][0]) answer += len[u] - len[fail[u]];
}
int main() {
  tot = root = 0;
  fail[root] = -1;
  scanf("%s", buf);
  for (int i = 0; buf[i]; i++) extend(buf[i] - 'a', 0);
  extend(26);
  scanf("%d", &n);
  for (int _ = 0; _ < n; _++) {
    scanf("%s%d%d", buf, &L[_], &R[_]);
    for (int i = 0; buf[i]; i++) extend(buf[i] - 'a', _ + 1);
    extend(26);
  }
  for (int i = 1; i <= tot; i++) G[fail[i]].push_back(i);
  dfs(root);
  printf("%d\n", answer);
  return 0;
}
