#include <bits/stdc++.h>
using namespace std;
const int N = 11;
const int FORBIDDEN = 11;
int z, n;
string s;
string p;
int a[N], b[N];
int ans, sorgsz;
void print(string s) {
  for (char c : s) {
    if (c <= FORBIDDEN) cerr << char(c + 'A' - 1);
    cerr << c;
  }
}
struct SuffixAutomaton {
  struct State {
    map<char, int> nbs;
    int suf = -1, len = 0, vis = 0;
    vector<int> ways;
    bool good = false;
  };
  vector<State> first;
  void init(string& s) {
    int last = 0;
    first.reserve(2 * s.size());
    first.push_back(State());
    for (int i = 0; i < s.size(); i++) {
      char c = s[i];
      first.push_back(State());
      int r = first.size() - 1;
      first[r].suf = 0;
      first[r].len = i + 1;
      int p = last;
      while (p >= 0 && !first[p].nbs.count(c)) {
        first[p].nbs[c] = r;
        p = first[p].suf;
      }
      if (p != -1) {
        int q = first[p].nbs[c];
        if (first[p].len + 1 == first[q].len) {
          first[r].suf = q;
        } else {
          first.push_back(first[q]);
          int qq = first.size() - 1;
          first[qq].len = first[p].len + 1;
          first[q].suf = first[r].suf = qq;
          while (p >= 0 && first[p].nbs[c] == q) {
            first[p].nbs[c] = qq;
            p = first[p].suf;
          }
        }
      }
      last = r;
      if (i == sorgsz - 1) {
        for (State& s : first) s.good = true;
      }
    }
  }
  void work(int v) {
    if (first[v].vis++) return;
    first[v].ways.resize(N + 1, 0);
    for (auto it : first[v].nbs) {
      char c = it.first;
      int w = it.second;
      work(w);
      for (int i = 1; i <= n; i++)
        if (c > FORBIDDEN) {
          first[v].ways[i] += first[w].ways[i];
        }
      if (c <= n) {
        first[v].ways[c]++;
      }
    }
  }
  void check(int v) {
    if (!first[v].good || first[v].vis++) {
      return;
    }
    int isok = 1;
    for (int id = 1; id <= n; id++) {
      int ways = first[v].ways[id];
      isok &= (a[id] <= ways && ways <= b[id]);
    }
    if (v) ans += isok * (first[v].len - first[first[v].suf].len);
    for (auto it : first[v].nbs) {
      check(it.second);
    }
  }
};
SuffixAutomaton sa;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> s;
  cin >> n;
  sorgsz = s.size();
  s += char(FORBIDDEN);
  for (int i = 1; i <= n; i++) {
    cin >> p >> a[i] >> b[i];
    s += p + char(i);
  }
  sa.init(s);
  sa.work(0);
  for (SuffixAutomaton::State& s : sa.first) {
    s.vis = 0;
  }
  sa.check(0);
  cout << ans << 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;
const int N = 11;
const int FORBIDDEN = 11;
int z, n;
string s;
string p;
int a[N], b[N];
int ans, sorgsz;
void print(string s) {
  for (char c : s) {
    if (c <= FORBIDDEN) cerr << char(c + 'A' - 1);
    cerr << c;
  }
}
struct SuffixAutomaton {
  struct State {
    map<char, int> nbs;
    int suf = -1, len = 0, vis = 0;
    vector<int> ways;
    bool good = false;
  };
  vector<State> first;
  void init(string& s) {
    int last = 0;
    first.reserve(2 * s.size());
    first.push_back(State());
    for (int i = 0; i < s.size(); i++) {
      char c = s[i];
      first.push_back(State());
      int r = first.size() - 1;
      first[r].suf = 0;
      first[r].len = i + 1;
      int p = last;
      while (p >= 0 && !first[p].nbs.count(c)) {
        first[p].nbs[c] = r;
        p = first[p].suf;
      }
      if (p != -1) {
        int q = first[p].nbs[c];
        if (first[p].len + 1 == first[q].len) {
          first[r].suf = q;
        } else {
          first.push_back(first[q]);
          int qq = first.size() - 1;
          first[qq].len = first[p].len + 1;
          first[q].suf = first[r].suf = qq;
          while (p >= 0 && first[p].nbs[c] == q) {
            first[p].nbs[c] = qq;
            p = first[p].suf;
          }
        }
      }
      last = r;
      if (i == sorgsz - 1) {
        for (State& s : first) s.good = true;
      }
    }
  }
  void work(int v) {
    if (first[v].vis++) return;
    first[v].ways.resize(N + 1, 0);
    for (auto it : first[v].nbs) {
      char c = it.first;
      int w = it.second;
      work(w);
      for (int i = 1; i <= n; i++)
        if (c > FORBIDDEN) {
          first[v].ways[i] += first[w].ways[i];
        }
      if (c <= n) {
        first[v].ways[c]++;
      }
    }
  }
  void check(int v) {
    if (!first[v].good || first[v].vis++) {
      return;
    }
    int isok = 1;
    for (int id = 1; id <= n; id++) {
      int ways = first[v].ways[id];
      isok &= (a[id] <= ways && ways <= b[id]);
    }
    if (v) ans += isok * (first[v].len - first[first[v].suf].len);
    for (auto it : first[v].nbs) {
      check(it.second);
    }
  }
};
SuffixAutomaton sa;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> s;
  cin >> n;
  sorgsz = s.size();
  s += char(FORBIDDEN);
  for (int i = 1; i <= n; i++) {
    cin >> p >> a[i] >> b[i];
    s += p + char(i);
  }
  sa.init(s);
  sa.work(0);
  for (SuffixAutomaton::State& s : sa.first) {
    s.vis = 0;
  }
  sa.check(0);
  cout << ans << endl;
}

```