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;
char str[500005];
char tmpstr[10][500005];
pair<int, int> P[500005];
int n;
struct SAM {
  int next[500005 * 2][26], fa[500005 * 2], len[500005 * 2], sz[500005 * 2];
  int last, cnt;
  int cntA[500005 * 2], A[500005 * 2];
  int num[500005 * 2], vis[500005 * 2];
  void clear() {
    last = cnt = 1;
    fa[1] = len[1] = 0;
    memset(next[1], 0, sizeof(next[1]));
  }
  void init(char *s) {
    while (*s) {
      Insert(*s - 'a');
      s++;
    }
  }
  void Insert(int c) {
    int p = last;
    int np = ++cnt;
    memset(next[cnt], 0, sizeof(next[cnt]));
    len[np] = len[p] + 1;
    last = np;
    while (p && !next[p][c]) next[p][c] = np, p = fa[p];
    if (!p)
      fa[np] = 1;
    else {
      int q = next[p][c];
      if (len[q] == len[p] + 1)
        fa[np] = q;
      else {
        int nq = ++cnt;
        len[nq] = len[p] + 1;
        memcpy(next[nq], next[q], sizeof(next[q]));
        fa[nq] = fa[q];
        fa[np] = fa[q] = nq;
        while (next[p][c] == q) next[p][c] = nq, p = fa[p];
      }
    }
  }
  void build() {
    memset(cntA, 0, sizeof(cntA));
    memset(num, 0, sizeof(num));
    for (int i = 1; i <= cnt; i++) cntA[len[i]]++;
    for (int i = 1; i <= cnt; i++) cntA[i] += cntA[i - 1];
    for (int i = cnt; i >= 1; i--) A[cntA[len[i]]--] = i;
  }
  void build(char *s, pair<int, int> p) {
    int Len = strlen(s), tmp = 1;
    memset(num, 0, sizeof(num));
    for (int i = 0; i < Len; i++) {
      num[tmp = next[tmp][s[i] - 'a']] = 1;
    }
    for (int i = cnt; i >= 1; i--) {
      int x = A[i];
      num[fa[x]] += num[x];
      if (num[x] >= p.first && num[x] <= p.second) {
        sz[x]++;
      }
    }
  }
  void query(char *s) {
    int res = 0;
    int Len = strlen(s), now = 1;
    for (int i = 0; i < Len; i++) {
      int c = s[i] - 'a';
      now = next[now][c];
      int tt = now;
      while (tt && !vis[tt]) {
        vis[tt] = 1;
        if (sz[tt] == n) res += len[tt] - len[fa[tt]];
        tt = fa[tt];
      }
    }
    printf("%d\n", res);
  }
  void debug() {
    for (int i = 1; i <= cnt; i++) {
      printf("fa[%d] = %d len[%d] = %d size[%d] = %d\n", i, fa[i], i, len[i], i,
             sz[i]);
    }
  }
} sam;
int main() {
  scanf("%s", str);
  sam.clear();
  sam.init(str);
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%s%d%d", tmpstr[i], &P[i].first, &P[i].second);
    sam.last = 1;
    sam.init(tmpstr[i]);
  }
  sam.build();
  for (int i = 0; i < n; i++) {
    sam.build(tmpstr[i], P[i]);
  }
  sam.query(str);
}
