#include <bits/stdc++.h>
using namespace std;
void createLPS(string s, long long len, long long lps[]) {
  lps[0] = 0;
  long long i = 1, j = 0;
  while (i < len) {
    if (s[i] == s[j]) {
      j++;
      lps[i] = j;
      i++;
    } else {
      if (j != 0) {
        j = lps[j - 1];
      } else {
        lps[i++] = 0;
      }
    }
  }
}
long long KMP(string pattern, string text) {
  long long n = text.length(), m = pattern.length();
  long long lps[m + 1];
  createLPS(pattern, m, lps);
  long long i = 0, j = 0, ans = 0;
  while (i < n) {
    if (text[i] == pattern[j]) {
      i++;
      j++;
    } else {
      if (j == 0) {
        i++;
      } else {
        j = lps[j - 1];
      }
    }
    if (j == m) {
      ans++;
      j = lps[j - 1];
    }
  }
  return ans;
}
bool func(string s, pair<string, pair<long long, long long> > A) {
  long long c;
  if (s.length() <= A.first.length())
    c = KMP(s, A.first);
  else
    c = 0;
  if (c >= A.second.first && c <= A.second.second) {
    return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  long long len = s.length();
  long long n;
  cin >> n;
  pair<string, pair<long long, long long> > p[n + 1];
  for (long long i = 1; i <= n; i++) {
    cin >> p[i].first >> p[i].second.first >> p[i].second.second;
  }
  set<string> myset;
  for (long long i = 0; i < len; i++) {
    string a = "";
    for (long long j = i; j < len; j++) {
      a = a + s[j];
      bool wrong = 0;
      for (long long k = 1; k <= n && wrong == 0; k++) {
        if (func(a, p[k]) == false) {
          wrong = 1;
        }
      }
      if (wrong == 0) {
        myset.insert(a);
      }
    }
  }
  cout << myset.size();
}

### Prompt

Your task is to create a cpp solution to the following problem:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
void createLPS(string s, long long len, long long lps[]) {
  lps[0] = 0;
  long long i = 1, j = 0;
  while (i < len) {
    if (s[i] == s[j]) {
      j++;
      lps[i] = j;
      i++;
    } else {
      if (j != 0) {
        j = lps[j - 1];
      } else {
        lps[i++] = 0;
      }
    }
  }
}
long long KMP(string pattern, string text) {
  long long n = text.length(), m = pattern.length();
  long long lps[m + 1];
  createLPS(pattern, m, lps);
  long long i = 0, j = 0, ans = 0;
  while (i < n) {
    if (text[i] == pattern[j]) {
      i++;
      j++;
    } else {
      if (j == 0) {
        i++;
      } else {
        j = lps[j - 1];
      }
    }
    if (j == m) {
      ans++;
      j = lps[j - 1];
    }
  }
  return ans;
}
bool func(string s, pair<string, pair<long long, long long> > A) {
  long long c;
  if (s.length() <= A.first.length())
    c = KMP(s, A.first);
  else
    c = 0;
  if (c >= A.second.first && c <= A.second.second) {
    return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  long long len = s.length();
  long long n;
  cin >> n;
  pair<string, pair<long long, long long> > p[n + 1];
  for (long long i = 1; i <= n; i++) {
    cin >> p[i].first >> p[i].second.first >> p[i].second.second;
  }
  set<string> myset;
  for (long long i = 0; i < len; i++) {
    string a = "";
    for (long long j = i; j < len; j++) {
      a = a + s[j];
      bool wrong = 0;
      for (long long k = 1; k <= n && wrong == 0; k++) {
        if (func(a, p[k]) == false) {
          wrong = 1;
        }
      }
      if (wrong == 0) {
        myset.insert(a);
      }
    }
  }
  cout << myset.size();
}

```