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 double pi = acos(-1.0), eps = 1e-9;
const int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[8] = {0, 0, 1, -1, 1, -1, -1, 1};
const int MO = (int)(1e9 + 7);
using namespace std;
struct Tsam {
  struct Tsamnode {
    int go[26], len, f;
  } a[20001];
  int A[300001];
  int tot, root, last;
  Tsam() {
    tot = 1;
    root = 1;
    last = 1;
  }
  void build(int nc) {
    int p = ++tot;
    while (last && a[last].go[nc] == 0) {
      a[last].go[nc] = p;
      last = a[last].f;
    }
    if (last == 0) {
      a[p].f = 1;
    } else {
      int q = a[last].go[nc];
      if (a[q].len == a[last].len + 1) {
        a[p].f = q;
      } else {
        int nq = ++tot;
        a[nq] = a[q];
        a[nq].len = a[last].len + 1;
        A[nq] = A[q];
        a[q].f = nq;
        a[p].f = nq;
        while (last && a[last].go[nc] == q) {
          a[last].go[nc] = nq;
          last = a[last].f;
        }
      }
    }
    last = p;
    while (p) ++A[p], p = a[p].f;
  }
  int npos;
  void restart() { npos = 1; }
  int goc(int t) {
    if (npos == -1) return 0;
    if (a[npos].go[t] == 0) {
      npos = -1;
      return 0;
    }
    npos = a[npos].go[t];
    return A[npos];
  }
} sam[10];
int n, L, l[1000001], r[1000001];
char s[1000001];
set<long long> M;
int count(int s) {
  long long nowhash = 0;
  int ret = 0;
  for (int i = 0; i < n; i++) sam[i].restart();
  for (int i = s; i < L; i++) {
    bool can = true;
    for (int j = 0; j < n; j++) {
      int temp = sam[j].goc(::s[i] - 'a');
      can = can && (temp >= l[j] && temp <= r[j]);
    }
    nowhash = nowhash * 1331 + ::s[i];
    if (M.count(nowhash)) continue;
    M.insert(nowhash);
    if (can) ++ret;
  }
  return ret;
}
char buf[1000001];
int main() {
  scanf("%s", s);
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf(" ");
    scanf("%s", buf);
    for (char *S = buf; *S; S++) sam[i].build(*S - 'a');
    scanf("%d%d", &l[i], &r[i]);
  }
  L = strlen(s);
  int ans = 0;
  for (int i = 0; i < L; i++) ans += count(i);
  cout << ans << endl;
}
