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 N = 11;
const int M = 2050;
const int pr = 1993;
const int mod = 1000000031;
vector<long long> st[N];
set<long long> dif;
int l[N], r[N];
long long hs[M], deg[M], ls[M * M];
void proc(int id, string s) {
  int n = (int)s.size();
  for (int i = 0; i < n; i++) {
    long long h = 0;
    for (int j = i; j < n; j++) {
      h = (h + s[j]) * pr;
      st[id].push_back(h);
    }
  }
}
int main() {
  string s;
  int n;
  cin >> s >> n;
  for (int i = 0; i < n; i++) {
    string p;
    cin >> p >> l[i] >> r[i];
    proc(i, p);
  }
  for (int i = 0; i < n; i++) {
    sort(st[i].begin(), st[i].end());
  }
  int ans = 0;
  int len = (int)s.size();
  deg[0] = 1;
  for (int i = 0; i < len; i++) {
    hs[i + 1] = (hs[i] + s[i]) * pr;
    deg[i + 1] = deg[i] * pr;
  }
  int kk = 0;
  for (int i = 0; i < len; i++)
    for (int j = i; j < len; j++) ls[kk++] = hs[j + 1] - hs[i] * deg[j - i + 1];
  sort(ls, ls + kk);
  kk = unique(ls, ls + kk) - ls;
  int cnt = 0;
  for (int it = 0; it < kk; it++) {
    cnt++;
    if (cnt == 100) {
      if (double(clock()) / double(CLOCKS_PER_SEC) > 3.95) break;
      cnt = 0;
    }
    long long h = ls[it];
    bool ok = 1;
    for (int k = 0; k < n; k++) {
      int cnt = upper_bound(st[k].begin(), st[k].end(), h) -
                lower_bound(st[k].begin(), st[k].end(), h);
      if (!(l[k] <= cnt && cnt <= r[k])) {
        ok = 0;
        break;
      }
    }
    if (ok) {
      ans++;
    }
  }
  cout << ans;
  return 0;
}
