#include <bits/stdc++.h>
using namespace std;
template <typename Tp>
inline void read(Tp &x) {
  static char c;
  static bool neg;
  x = 0, c = getchar(), neg = false;
  for (; !isdigit(c); c = getchar()) {
    if (c == '-') {
      neg = true;
    }
  }
  for (; isdigit(c); c = getchar()) {
    x = x * 10 + c - '0';
  }
  if (neg) {
    x = -x;
  }
}
const int N = 50000 + 5;
const int MX = N * 22;
const int CS = 26;
const int G = 10 + 1;
char str[N];
int n;
int L[G], R[G];
namespace SAM {
struct Node {
  Node *son[CS], *link;
  int max;
  int size[G];
  inline const int cover() const { return max - link->max; }
};
Node pool[MX];
int poolCnt = 0;
inline Node *newNode(int max = 0) {
  Node *res = &pool[poolCnt++];
  res->max = max;
  return res;
}
Node *start, *last;
inline void init() { start = newNode(); }
inline Node *extend(char c) {
  Node *u, *v = last;
  int n = c - 'a';
  if (v->son[n] != nullptr) {
    if (v->son[n]->max == v->max + 1) {
      u = v->son[n];
    } else {
      Node *now = newNode(v->max + 1), *old = v->son[n];
      now->link = old->link;
      old->link = u = now;
      copy(old->son, old->son + CS, now->son);
      for (; v != nullptr && v->son[n] == old; v = v->link) {
        v->son[n] = now;
      }
    }
  } else {
    u = newNode(last->max + 1);
    for (; v != nullptr && v->son[n] == nullptr; v = v->link) {
      v->son[n] = u;
    }
    if (v == nullptr) {
      u->link = start;
    } else if (v->son[n]->max == v->max + 1) {
      u->link = v->son[n];
    } else {
      Node *now = newNode(v->max + 1), *old = v->son[n];
      copy(old->son, old->son + CS, now->son);
      now->link = old->link;
      old->link = u->link = now;
      for (; v != nullptr && v->son[n] == old; v = v->link) {
        v->son[n] = now;
      }
    }
  }
  last = u;
  return u;
}
inline void insert(const char *str, int id) {
  int pos = 0;
  last = start;
  while (pos[str] != '\0') {
    extend(pos[str])->size[id] = 1;
    ++pos;
  }
}
int bkt[N];
Node *sa[MX];
inline bool check(int u) {
  for (int i = 1; i <= n; ++i) {
    if (pool[u].size[i] < L[i] || pool[u].size[i] > R[i]) {
      return false;
    }
  }
  return true;
}
inline void query() {
  int max = 0;
  for (int i = 0; i < poolCnt; ++i) {
    ++bkt[pool[i].max];
    max = std::max(max, pool[i].max);
  }
  for (int i = 1; i <= max; ++i) {
    bkt[i] += bkt[i - 1];
  }
  for (int i = 0; i < poolCnt; ++i) {
    sa[--bkt[pool[i].max]] = &pool[i];
  }
  Node *u;
  for (int i = poolCnt - 1; i >= 0; --i) {
    u = sa[i];
    if (u->link != nullptr) {
      for (int i = 0; i <= n; ++i) {
        u->link->size[i] += u->size[i];
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i < poolCnt; ++i) {
    if (pool[i].size[0] != 0 && check(i)) {
      ans += pool[i].cover();
    }
  }
  printf("%lld\n", ans);
}
}  // namespace SAM
int main() {
  SAM::init();
  scanf("%s", str);
  SAM::insert(str, 0);
  read(n);
  for (int i = 1; i <= n; ++i) {
    scanf("%s", str);
    SAM::insert(str, i);
    read(L[i]), read(R[i]);
  }
  SAM::query();
}

### 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;
template <typename Tp>
inline void read(Tp &x) {
  static char c;
  static bool neg;
  x = 0, c = getchar(), neg = false;
  for (; !isdigit(c); c = getchar()) {
    if (c == '-') {
      neg = true;
    }
  }
  for (; isdigit(c); c = getchar()) {
    x = x * 10 + c - '0';
  }
  if (neg) {
    x = -x;
  }
}
const int N = 50000 + 5;
const int MX = N * 22;
const int CS = 26;
const int G = 10 + 1;
char str[N];
int n;
int L[G], R[G];
namespace SAM {
struct Node {
  Node *son[CS], *link;
  int max;
  int size[G];
  inline const int cover() const { return max - link->max; }
};
Node pool[MX];
int poolCnt = 0;
inline Node *newNode(int max = 0) {
  Node *res = &pool[poolCnt++];
  res->max = max;
  return res;
}
Node *start, *last;
inline void init() { start = newNode(); }
inline Node *extend(char c) {
  Node *u, *v = last;
  int n = c - 'a';
  if (v->son[n] != nullptr) {
    if (v->son[n]->max == v->max + 1) {
      u = v->son[n];
    } else {
      Node *now = newNode(v->max + 1), *old = v->son[n];
      now->link = old->link;
      old->link = u = now;
      copy(old->son, old->son + CS, now->son);
      for (; v != nullptr && v->son[n] == old; v = v->link) {
        v->son[n] = now;
      }
    }
  } else {
    u = newNode(last->max + 1);
    for (; v != nullptr && v->son[n] == nullptr; v = v->link) {
      v->son[n] = u;
    }
    if (v == nullptr) {
      u->link = start;
    } else if (v->son[n]->max == v->max + 1) {
      u->link = v->son[n];
    } else {
      Node *now = newNode(v->max + 1), *old = v->son[n];
      copy(old->son, old->son + CS, now->son);
      now->link = old->link;
      old->link = u->link = now;
      for (; v != nullptr && v->son[n] == old; v = v->link) {
        v->son[n] = now;
      }
    }
  }
  last = u;
  return u;
}
inline void insert(const char *str, int id) {
  int pos = 0;
  last = start;
  while (pos[str] != '\0') {
    extend(pos[str])->size[id] = 1;
    ++pos;
  }
}
int bkt[N];
Node *sa[MX];
inline bool check(int u) {
  for (int i = 1; i <= n; ++i) {
    if (pool[u].size[i] < L[i] || pool[u].size[i] > R[i]) {
      return false;
    }
  }
  return true;
}
inline void query() {
  int max = 0;
  for (int i = 0; i < poolCnt; ++i) {
    ++bkt[pool[i].max];
    max = std::max(max, pool[i].max);
  }
  for (int i = 1; i <= max; ++i) {
    bkt[i] += bkt[i - 1];
  }
  for (int i = 0; i < poolCnt; ++i) {
    sa[--bkt[pool[i].max]] = &pool[i];
  }
  Node *u;
  for (int i = poolCnt - 1; i >= 0; --i) {
    u = sa[i];
    if (u->link != nullptr) {
      for (int i = 0; i <= n; ++i) {
        u->link->size[i] += u->size[i];
      }
    }
  }
  long long ans = 0;
  for (int i = 1; i < poolCnt; ++i) {
    if (pool[i].size[0] != 0 && check(i)) {
      ans += pool[i].cover();
    }
  }
  printf("%lld\n", ans);
}
}  // namespace SAM
int main() {
  SAM::init();
  scanf("%s", str);
  SAM::insert(str, 0);
  read(n);
  for (int i = 1; i <= n; ++i) {
    scanf("%s", str);
    SAM::insert(str, i);
    read(L[i]), read(R[i]);
  }
  SAM::query();
}

```