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 MAXLEN = 2100;
struct hash_map {
  const static int mod = 1000007;
  int head[mod];
  struct hash_tables {
    pair<unsigned int, unsigned int> key;
    int val;
    int next;
  } ele[3000007];
  int N;
  int getHash(pair<unsigned int, unsigned int> x) {
    return (x.first + x.second) % mod;
  }
  void init() {
    memset(head, 255, sizeof(head));
    N = 0;
  }
  void clear() {
    for (int i = 0; i < N; i++) head[getHash(ele[i].key)] = -1;
    N = 0;
  }
  int fint(pair<unsigned int, unsigned int> x) {
    for (int i = head[getHash(x)]; i != -1; i = ele[i].next)
      if (ele[i].key == x) return i;
    return -1;
  }
  void insert(pair<unsigned int, unsigned int> x) {
    int tmp = getHash(x);
    ele[N].key = x;
    ele[N].val = 0;
    ele[N].next = head[tmp];
    head[tmp] = N++;
  }
  int& operator[](pair<unsigned int, unsigned int> x) {
    int tmp = fint(x);
    if (tmp == -1) {
      insert(x);
      return ele[N - 1].val;
    } else
      return ele[tmp].val;
  }
};
const int muts[2] = {129, 131};
unsigned int sum[2][MAXLEN], psum[2][MAXLEN];
unsigned int mutpower[2][MAXLEN];
unsigned int gethashcode(int id, unsigned int sum[2][MAXLEN], int l, int r) {
  unsigned int ret;
  ret = sum[id][r];
  if (l) ret -= sum[id][l - 1] * mutpower[id][r - l + 1];
  return ret;
}
char s[MAXLEN];
int n;
char p[10][MAXLEN];
int l[10], r[10];
hash_map cnt, _cnt, pcnt;
int main() {
  cnt.init();
  _cnt.init();
  pcnt.init();
  for (int id = 0; id < 2; id++) {
    mutpower[id][0] = 1;
    for (int i = 1; i < MAXLEN; i++)
      mutpower[id][i] = mutpower[id][i - 1] * muts[id];
  }
  scanf("%s", s);
  for (int id = 0; id < 2; id++) {
    sum[id][0] = s[0];
    for (int i = 1; s[i] != 0; i++)
      sum[id][i] = sum[id][i - 1] * muts[id] + s[i];
  }
  for (int i = 0; s[i] != 0; i++)
    for (int j = i; s[j] != 0; j++)
      cnt[make_pair(gethashcode(0, sum, i, j), gethashcode(1, sum, i, j))] = 1;
  scanf("%d", &n);
  for (int id = 0; id < n; id++) {
    scanf("%s%d%d", p[id], &l[id], &r[id]);
    for (int ii = 0; ii < 2; ii++) {
      psum[ii][0] = p[id][0];
      for (int i = 1; p[id][i] != 0; i++)
        psum[ii][i] = psum[ii][i - 1] * muts[ii] + p[id][i];
    }
    pcnt.clear();
    for (int i = 0; p[id][i] != 0; i++)
      for (int j = i; p[id][j] != 0; j++) {
        pair<unsigned int, unsigned int> tmp =
            make_pair(gethashcode(0, psum, i, j), gethashcode(1, psum, i, j));
        if (cnt.fint(tmp) != -1) pcnt[tmp]++;
      }
    _cnt.clear();
    for (int i = 0; i < cnt.N; i++) {
      int val = pcnt[cnt.ele[i].key];
      if (val >= l[id] && val <= r[id]) _cnt.insert(cnt.ele[i].key);
    }
    cnt = _cnt;
  }
  printf("%d\n", cnt.N);
  return 0;
}
