#include <bits/stdc++.h>
using namespace std;
const int N = 2002;
char s[2002];
int cnt[10][N];
int power[N];
int power2[N];
int mulTable[2002][2002];
int mulTable2[2002][2002];
int fail[N];
int stringHash[N];
int stringHash2[N];
char matches[N][N];
int lower[N], upper[N];
set<pair<int, int> > t;
int n;
int add(int a, int b) {
  a = a + b;
  if (a > 1000000009) a -= 1000000009;
  return a;
}
int add2(int a, int b) {
  a = a + b;
  if (a > 1000000007) a -= 1000000007;
  return a;
}
int mul(long long a, int b) { return a * b % 1000000009; }
int mul2(long long a, int b) { return a * b % 1000000007; }
void prepareHash(string s) {
  int curr = 0;
  int curr2 = 0;
  for (int i = 0; i < s.length(); i++) {
    curr = add(mul(curr, 37LL), (s[i] - 'a' + 1));
    stringHash[i + 1] = curr;
    curr2 = add2(mul2(curr2, 31LL), (s[i] - 'a' + 1));
    stringHash2[i + 1] = curr2;
  }
  for (int i = 0; i <= s.length(); i++) {
    for (int j = 0; j <= s.length(); j++) {
      mulTable[i][j] = mul(stringHash[i], power[j]);
      mulTable2[i][j] = mul2(stringHash2[i], power2[j]);
    }
  }
}
void hashTo(int start, int len) {
  t.insert(make_pair(
      add(stringHash[start + len] + 1000000009, -mulTable[start][len]),
      add2(stringHash2[start + len] + 1000000007, -mulTable2[start][len])));
}
void buildFail(string pat, int start) {
  memset(fail, 0, sizeof fail);
  int patLen = pat.length();
  for (int i = 1, k = 0; i < patLen; i++) {
    while (k > 0 && pat[i] != pat[k]) k = fail[k - 1];
    if (pat[i] == pat[k]) k++;
    fail[i] = k;
  }
  memset(cnt, 0, sizeof cnt);
  for (int i = 0; i < n; i++) {
    string curr = matches[i];
    int currLen = curr.length();
    for (int j = 0, k = 0; j < currLen; j++) {
      while (k > 0 && curr[j] != pat[k]) k = fail[k - 1];
      if (pat[k] == curr[j]) {
        cnt[i][++k]++;
      }
      if (k == patLen) k = fail[k - 1];
    }
    for (int j = patLen; j > 0; j--) {
      cnt[i][fail[j - 1]] += cnt[i][j];
    }
  }
  for (int i = 1; i <= patLen; i++) {
    int tempCnt = 0;
    for (int j = 0; j < n; j++)
      if (cnt[j][i] >= lower[j] && cnt[j][i] <= upper[j])
        tempCnt++;
      else
        break;
    if (tempCnt == n) {
      hashTo(start, i);
    }
  }
}
int main() {
  power[0] = power2[0] = 1;
  scanf("%s", s);
  for (int i = 1; i <= strlen(s); i++) {
    power[i] = mul(power[i - 1], 37LL);
    power2[i] = mul2(power2[i - 1], 31LL);
  }
  scanf("%d", &n);
  for (int i = 0; i < n; i++)
    scanf("%s %d %d", matches[i], &lower[i], &upper[i]);
  prepareHash(s);
  string temp = string(s);
  for (int i = 0; i < strlen(s); i++) {
    string tempS = temp.substr(i);
    buildFail(tempS, i);
  }
  printf("%d", t.size());
  return 0;
}

### Prompt

In cpp, your task is to solve 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;
const int N = 2002;
char s[2002];
int cnt[10][N];
int power[N];
int power2[N];
int mulTable[2002][2002];
int mulTable2[2002][2002];
int fail[N];
int stringHash[N];
int stringHash2[N];
char matches[N][N];
int lower[N], upper[N];
set<pair<int, int> > t;
int n;
int add(int a, int b) {
  a = a + b;
  if (a > 1000000009) a -= 1000000009;
  return a;
}
int add2(int a, int b) {
  a = a + b;
  if (a > 1000000007) a -= 1000000007;
  return a;
}
int mul(long long a, int b) { return a * b % 1000000009; }
int mul2(long long a, int b) { return a * b % 1000000007; }
void prepareHash(string s) {
  int curr = 0;
  int curr2 = 0;
  for (int i = 0; i < s.length(); i++) {
    curr = add(mul(curr, 37LL), (s[i] - 'a' + 1));
    stringHash[i + 1] = curr;
    curr2 = add2(mul2(curr2, 31LL), (s[i] - 'a' + 1));
    stringHash2[i + 1] = curr2;
  }
  for (int i = 0; i <= s.length(); i++) {
    for (int j = 0; j <= s.length(); j++) {
      mulTable[i][j] = mul(stringHash[i], power[j]);
      mulTable2[i][j] = mul2(stringHash2[i], power2[j]);
    }
  }
}
void hashTo(int start, int len) {
  t.insert(make_pair(
      add(stringHash[start + len] + 1000000009, -mulTable[start][len]),
      add2(stringHash2[start + len] + 1000000007, -mulTable2[start][len])));
}
void buildFail(string pat, int start) {
  memset(fail, 0, sizeof fail);
  int patLen = pat.length();
  for (int i = 1, k = 0; i < patLen; i++) {
    while (k > 0 && pat[i] != pat[k]) k = fail[k - 1];
    if (pat[i] == pat[k]) k++;
    fail[i] = k;
  }
  memset(cnt, 0, sizeof cnt);
  for (int i = 0; i < n; i++) {
    string curr = matches[i];
    int currLen = curr.length();
    for (int j = 0, k = 0; j < currLen; j++) {
      while (k > 0 && curr[j] != pat[k]) k = fail[k - 1];
      if (pat[k] == curr[j]) {
        cnt[i][++k]++;
      }
      if (k == patLen) k = fail[k - 1];
    }
    for (int j = patLen; j > 0; j--) {
      cnt[i][fail[j - 1]] += cnt[i][j];
    }
  }
  for (int i = 1; i <= patLen; i++) {
    int tempCnt = 0;
    for (int j = 0; j < n; j++)
      if (cnt[j][i] >= lower[j] && cnt[j][i] <= upper[j])
        tempCnt++;
      else
        break;
    if (tempCnt == n) {
      hashTo(start, i);
    }
  }
}
int main() {
  power[0] = power2[0] = 1;
  scanf("%s", s);
  for (int i = 1; i <= strlen(s); i++) {
    power[i] = mul(power[i - 1], 37LL);
    power2[i] = mul2(power2[i - 1], 31LL);
  }
  scanf("%d", &n);
  for (int i = 0; i < n; i++)
    scanf("%s %d %d", matches[i], &lower[i], &upper[i]);
  prepareHash(s);
  string temp = string(s);
  for (int i = 0; i < strlen(s); i++) {
    string tempS = temp.substr(i);
    buildFail(tempS, i);
  }
  printf("%d", t.size());
  return 0;
}

```