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;
template <class T>
T inline Abs(const T& x) {
  return x < 0 ? -x : x;
}
template <class T>
T inline Sqr(const T& x) {
  return x * x;
}
long long p = 1543;
long long P[100000];
int main(int argc, char* argv[]) {
  P[0] = 1;
  for (int i = 1; i < 100000; ++i) {
    P[i] = P[i - 1] * p;
  }
  string s;
  int n;
  cin >> s >> n;
  vector<string> t(n);
  vector<int> l(n), r(n);
  for (int i = 0; i < n; ++i) {
    cin >> t[i] >> l[i] >> r[i];
  }
  long long ans = 0;
  for (int len = 1; len <= s.length(); ++len) {
    long long h = 0;
    for (int i = 0; i < len; ++i) {
      h = h * p + s[s.length() - 1 - i];
    }
    unordered_map<long long, vector<int> > mp;
    for (int i = s.length() - len; i >= 0; --i) {
      mp[h] = vector<int>(n, 0);
      if (i > 0) {
        h -= s[i + len - 1] * P[len - 1];
        h *= p;
        h += s[i - 1];
      }
    }
    for (int pr = 0; pr < n; ++pr) {
      if (len > t[pr].length()) {
        continue;
      }
      long long h = 0;
      for (int i = 0; i < len; ++i) {
        h = h * p + t[pr][t[pr].length() - 1 - i];
      }
      for (int i = t[pr].length() - len; i >= 0; --i) {
        if (mp.count(h)) {
          ++mp[h][pr];
        }
        if (i > 0) {
          h -= t[pr][i + len - 1] * P[len - 1];
          h *= p;
          h += t[pr][i - 1];
        }
      }
    }
    for (auto it = mp.begin(); it != mp.end(); ++it) {
      bool good = true;
      for (int i = 0; i < n; ++i) {
        if (it->second[i] < l[i] || it->second[i] > r[i]) {
          good = false;
          break;
        }
      }
      if (good) {
        ++ans;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
