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;
const int N = 1e6 + 6;
int link[N], cnt = 1, len[N], nxt[N][26], num[N][13], l[13], r[13], in[N], n;
char s[N];
long long ans;
int insert(int c, int las, int o) {
  if (nxt[las][c]) {
    int p = las, q = nxt[las][c];
    if (len[p] + 1 == len[q]) {
      num[q][o] = 1;
      return q;
    } else {
      int clone = ++cnt;
      len[clone] = len[p] + 1;
      link[clone] = link[q];
      link[q] = clone;
      memcpy(nxt[clone], nxt[q], sizeof(nxt[q]));
      for (; nxt[p][c] == q; p = link[p]) nxt[p][c] = clone;
      num[clone][o] = 1;
      return clone;
    }
  }
  int cur = ++cnt;
  len[cur] = len[las] + 1;
  int p = las;
  for (; p && nxt[p][c] == 0; p = link[p]) nxt[p][c] = cur;
  if (!p)
    link[cur] = 1;
  else {
    int q = nxt[p][c];
    if (len[q] == len[p] + 1)
      link[cur] = q;
    else {
      int clone = ++cnt;
      len[clone] = len[p] + 1;
      link[clone] = link[q];
      link[q] = link[cur] = clone;
      memcpy(nxt[clone], nxt[q], sizeof(nxt[q]));
      for (; nxt[p][c] == q; p = link[p]) nxt[p][c] = clone;
    }
  }
  num[cur][o] = 1;
  return cur;
}
void topu() {
  queue<int> q;
  for (int i = 1; i <= cnt; i++) in[link[i]]++;
  for (int i = 1; i <= cnt; i++)
    if (!in[i]) q.push(i);
  while (!q.empty()) {
    int now = q.front();
    q.pop();
    for (int i = 0; i <= n; i++) num[link[now]][i] += num[now][i];
    if (--in[link[now]] == 0) q.push(link[now]);
  }
}
bool check(int o) {
  for (int i = 1; i <= n; i++) {
    if (num[o][i] > r[i] || num[o][i] < l[i]) return 0;
  }
  return 1;
}
int main() {
  int t;
  scanf("%s %d", s + 1, &t);
  int sl = strlen(s + 1), las = 1;
  for (int i = 1; i <= sl; i++) las = insert(s[i] - 'a', las, 0);
  n = t;
  for (int j = 1; j <= t; j++) {
    scanf("%s %d %d", s + 1, l + j, r + j);
    sl = strlen(s + 1), las = 1;
    for (int i = 1; i <= sl; i++) las = insert(s[i] - 'a', las, j);
  }
  topu();
  for (int i = 1; i <= cnt; i++)
    if (num[i][0] && check(i)) ans += len[i] - len[link[i]];
  cout << ans;
  return 0;
}
