#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
double EPS = 1e-7;
int INF = 1000000000;
int MAXINT = 2147483647;
long long INFLL = 1000000000000000000LL;
long long MAXLL = 9223372036854775807LL;
pair<int, int> M[8] = {make_pair(0, 1),  make_pair(1, 0),  make_pair(-1, 0),
                       make_pair(0, -1), make_pair(-1, 1), make_pair(-1, -1),
                       make_pair(1, -1), make_pair(1, 1)};
char s[2005];
string lol[2005];
pair<int, int> req[2005];
int p[2005];
set<string> kya;
int main() {
  gets(s);
  int len = strlen(s);
  int k;
  cin >> k;
  for (int(a) = (1); (a) <= (k); (a)++) {
    cin >> lol[a] >> req[a].first >> req[a].second;
  }
  int ans = 0;
  for (int(a) = (0); (a) <= (len - 1); (a)++) {
    for (int(b) = (a); (b) <= (len - 1); (b)++) {
      int j = -1;
      p[0] = -1;
      int ls = b - a;
      for (int(i) = (0); (i) <= (ls); (i)++) {
        while (j >= 0 && s[a + i] != s[a + j]) j = p[j];
        j++;
        p[i + 1] = j;
      }
      bool bisa = 1;
      for (int(c) = (1); (c) <= (k); (c)++) {
        int j = 0;
        int found = 0;
        for (int(i) = (0); (i) <= (lol[c].length() - 1); (i)++) {
          while (j >= 0 && lol[c][i] != s[a + j]) j = p[j];
          j++;
          if (j == ls + 1) {
            found++;
            j = p[j];
          }
        }
        if (req[c].first <= found && found <= req[c].second)
          ;
        else {
          bisa = 0;
          break;
        }
      }
      if (bisa) {
        string y = "";
        for (int(o) = (a); (o) <= (b); (o)++) y += s[o];
        kya.insert(y);
        ans++;
      }
    }
  }
  cout << (int)kya.size() << endl;
}

### Prompt

Generate 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;
double PI = acos(-1);
double EPS = 1e-7;
int INF = 1000000000;
int MAXINT = 2147483647;
long long INFLL = 1000000000000000000LL;
long long MAXLL = 9223372036854775807LL;
pair<int, int> M[8] = {make_pair(0, 1),  make_pair(1, 0),  make_pair(-1, 0),
                       make_pair(0, -1), make_pair(-1, 1), make_pair(-1, -1),
                       make_pair(1, -1), make_pair(1, 1)};
char s[2005];
string lol[2005];
pair<int, int> req[2005];
int p[2005];
set<string> kya;
int main() {
  gets(s);
  int len = strlen(s);
  int k;
  cin >> k;
  for (int(a) = (1); (a) <= (k); (a)++) {
    cin >> lol[a] >> req[a].first >> req[a].second;
  }
  int ans = 0;
  for (int(a) = (0); (a) <= (len - 1); (a)++) {
    for (int(b) = (a); (b) <= (len - 1); (b)++) {
      int j = -1;
      p[0] = -1;
      int ls = b - a;
      for (int(i) = (0); (i) <= (ls); (i)++) {
        while (j >= 0 && s[a + i] != s[a + j]) j = p[j];
        j++;
        p[i + 1] = j;
      }
      bool bisa = 1;
      for (int(c) = (1); (c) <= (k); (c)++) {
        int j = 0;
        int found = 0;
        for (int(i) = (0); (i) <= (lol[c].length() - 1); (i)++) {
          while (j >= 0 && lol[c][i] != s[a + j]) j = p[j];
          j++;
          if (j == ls + 1) {
            found++;
            j = p[j];
          }
        }
        if (req[c].first <= found && found <= req[c].second)
          ;
        else {
          bisa = 0;
          break;
        }
      }
      if (bisa) {
        string y = "";
        for (int(o) = (a); (o) <= (b); (o)++) y += s[o];
        kya.insert(y);
        ans++;
      }
    }
  }
  cout << (int)kya.size() << endl;
}

```