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 mod = (int)1e9 + 9;
string second;
int L[1000], size[100], R[10000], wh[1000], end[1000];
int n, An, Wn;
long long W[2000000], A[2000000], ok[3000000];
int main() {
  cin >> second;
  cin >> n;
  for (int l = 0; l < second.size(); ++l) {
    long long hsh = 0;
    for (int i = l; i < second.size(); ++i) {
      hsh = (hsh * 31 + second[i] - 'a' + 1);
      A[An++] = hsh;
    }
  }
  sort(A, A + An);
  An = unique(A, A + An) - A;
  for (int i = 0; i < An; ++i) ok[i] = true;
  for (int i = 1; i <= n; ++i) {
    string t;
    int L, R;
    cin >> t >> L >> R;
    Wn = 0;
    for (int l = 0; l < t.size(); ++l) {
      long long hsh = 0;
      for (int j = l; j < t.size(); ++j) {
        hsh = (hsh * 31 + t[j] - 'a' + 1);
        W[Wn++] = hsh;
      }
    }
    sort(W, W + Wn);
    int j = 0;
    for (int i = 0; i < An; ++i) {
      while (j < Wn && W[j] < A[i]) ++j;
      int cnt = 0;
      while (j < Wn && W[j] == A[i]) {
        ++j;
        ++cnt;
      }
      if (!(L <= cnt && cnt <= R)) ok[i] = false;
    }
  }
  int ans = 0;
  for (int i = 0; i < An; ++i) ans += ok[i];
  cout << ans << endl;
  return 0;
}
