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;
long long mul1 = 239017;
long long mul2 = 239021;
long long mod1 = 1000000007;
long long mod2 = 1000000021;
const int MAXN = 1 << 23;
unsigned long long h[MAXN + 1000];
int cnt[MAXN + 1000];
char s[100005];
void gen_hashes(void) {
  int l = strlen(s);
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < l; i++) {
    const long long hash1 = 0;
    long long hash2 = 0;
    for (int j = i; j < l; j++) {
      hash2 = hash2 * mul2 + s[j];
      unsigned long long hash = ((hash1 << 32) + hash2);
      int pos = hash & (MAXN - 1);
      while (cnt[pos] && h[pos] != hash) {
        pos++;
      }
      h[pos] = hash;
      cnt[pos]++;
    }
  }
}
unsigned long long res[2100000];
int main(void) {
  int n;
  scanf("%s%d", s, &n);
  int resl = 0;
  gen_hashes();
  for (int i = 0; i < MAXN + 1000; i++) {
    if (cnt[i]) {
      res[resl++] = h[i];
    }
  }
  for (int i = 1; i <= n; i++) {
    int l, r;
    scanf("%s%d%d", s, &l, &r);
    r -= l;
    gen_hashes();
    int nl = 0;
    for (int i = 0; i < resl; i++) {
      unsigned long long hash = res[i];
      int pos = hash & (MAXN - 1);
      while (cnt[pos] && h[pos] != hash) {
        pos++;
      }
      if ((unsigned int)(cnt[pos] - l) <= (unsigned int)r) {
        res[nl++] = hash;
      }
    }
    resl = nl;
  }
  printf("%d\n", resl);
  return 0;
}
