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 ruln = 11;
const int maxn = 2020;
char s[maxn];
char p[maxn];
int cl[maxn];
int cr[maxn];
int clen[maxn];
long long ps[ruln][maxn];
long long p37[maxn];
int ans_size = 0;
long long ans[maxn * maxn];
long long cur[maxn * maxn];
bool isgood[maxn * maxn];
int main(int argc, char **argv) {
  p37[0] = 1;
  for (int i = 1; i < maxn; ++i) {
    p37[i] = 37 * p37[i - 1];
  }
  scanf("%s", s);
  int len = strlen(s);
  for (int l = 0; l < len; ++l) {
    long long chash = 0;
    for (int r = l; r < len; ++r) {
      chash = chash + p37[r - l] * (s[r] - 'a' + 3);
      ans[ans_size++] = chash;
    }
  }
  sort(ans, ans + ans_size);
  ans_size = unique(ans, ans + ans_size) - ans;
  for (int i = 0; i < ans_size; ++i) {
    isgood[i] = true;
  }
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("\n%s %d %d", p, cl + i, cr + i);
    int len = strlen(p);
    int cur_size = 0;
    for (int il = 0; il < len; ++il) {
      long long chash = 0;
      for (int ir = il; ir < len; ++ir) {
        chash = chash + p37[ir - il] * (p[ir] - 'a' + 3);
        cur[cur_size++] = chash;
      }
    }
    sort(cur, cur + cur_size);
    int iter = 0;
    for (int j = 0; j < ans_size; ++j) {
      while (iter < cur_size && cur[iter] < ans[j]) ++iter;
      int cnt = 0;
      while (iter < cur_size && cur[iter] == ans[j]) {
        ++iter;
        ++cnt;
      }
      if (cnt < cl[i] || cnt > cr[i]) {
        isgood[j] = false;
      }
    }
  }
  int ans_res = 0;
  for (int i = 0; i < ans_size; ++i)
    if (isgood[i]) {
      ++ans_res;
    }
  printf("%d\n", ans_res);
  return 0;
}
