#include <bits/stdc++.h>
using namespace std;
const int N = 600010;
int n, m;
int l[N], r[N];
char a[N];
char pool[N], *s[N], *cur;
int sa[N], tmp[N], lcp[N], pos[N], len, sz;
int rmq[20][N];
char b[N];
int cnt[20][N];
bool cmp(int u, int v) {
  if (pos[u] != pos[v]) {
    return pos[u] < pos[v];
  }
  u += len;
  v += len;
  if (u < m && v < m) {
    return pos[u] < pos[v];
  }
  return u > v;
}
int c[N];
void stupidSort(int add) {
  memset(c, 0, sizeof c);
  for (int i = 0; i < m; i++) {
    c[i + add >= m ? 0 : pos[i + add]]++;
  }
  for (int i = 1; i < N; i++) {
    c[i] += c[i - 1];
  }
  for (int i = m - 1; i >= 0; i--) {
    int id = sa[i];
    tmp[--c[id + add >= m ? 0 : pos[id + add]]] = id;
  }
  for (int i = 0; i < m; i++) {
    sa[i] = tmp[i];
  }
}
void buildSa() {
  sz = strlen(a);
  for (int i = 0; i < sz; i++) {
    b[i] = a[i];
  }
  b[sz] = '#';
  int curMem = sz;
  for (int i = 1; i <= n; i++) {
    int szNow = strlen(s[i]);
    for (int j = 0; j < szNow; j++) {
      b[++curMem] = s[i][j];
    }
    b[++curMem] = '#';
  }
  m = strlen(b);
  for (int i = 0; i < m; i++) {
    sa[i] = i;
    pos[i] = b[i];
  }
  len = 1;
  while (1) {
    stupidSort(len);
    stupidSort(0);
    tmp[0] = 1;
    for (int i = 1; i < m; i++) {
      tmp[i] = tmp[i - 1] + cmp(sa[i - 1], sa[i]);
    }
    for (int i = 0; i < m; i++) {
      pos[sa[i]] = tmp[i];
    }
    if (tmp[m - 1] == m) {
      break;
    }
    len <<= 1;
  }
  for (int i = 0; i < m; i++) {
    pos[i]--;
  }
  len = 0;
  for (int i = 0; i < m; i++) {
    if (pos[i] == m - 1) {
      continue;
    }
    int u = sa[pos[i] + 1];
    while (b[i + len] == b[u + len]) {
      len++;
    }
    lcp[pos[i]] = len;
    if (len) {
      len--;
    }
  }
  for (int i = 0; i < m - 1; i++) {
    rmq[0][i] = lcp[i];
  }
  for (int i = 1; i < 20; i++) {
    for (int j = 0; j < m - (1 << i); j++) {
      rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    }
  }
  for (int i = 0; i < sz; i++) {
    cnt[0][pos[i]] = 1;
  }
  curMem = sz;
  for (int i = 1; i <= n; i++) {
    int szNow = strlen(s[i]);
    for (int j = 0; j < szNow; j++) {
      cnt[i][pos[++curMem]] = 1;
    }
    curMem++;
  }
  for (int i = 0; i <= n; i++) {
    for (int j = 1; j < m; j++) {
      cnt[i][j] += cnt[i][j - 1];
    }
  }
}
int getMin(int l, int r) {
  int h = log2(r - l + 1);
  return min(rmq[h][l], rmq[h][r - (1 << h) + 1]);
}
void getPos(int &l, int &r, int u, int id) {
  int low = -1, high = id;
  while (high - low > 1) {
    int mid = (low + high) >> 1;
    if (getMin(mid, id - 1) >= u) {
      high = mid;
    } else {
      low = mid;
    }
  }
  l = high;
  low = id, high = m - 1;
  while (high - low > 1) {
    int mid = (high + low) >> 1;
    if (getMin(id, mid - 1) >= u) {
      low = mid;
    } else {
      high = mid;
    }
  }
  r = low;
}
bool checkLow(int u, int id) {
  int low, high;
  getPos(low, high, u, id);
  for (int i = 1; i <= n; i++) {
    int sum = cnt[i][high];
    if (low) {
      sum -= cnt[i][low - 1];
    }
    if (sum < l[i]) {
      return 0;
    }
  }
  return 1;
}
bool checkHigh(int u, int id) {
  int low, high;
  getPos(low, high, u, id);
  for (int i = 1; i <= n; i++) {
    int sum = cnt[i][high];
    if (low) {
      sum -= cnt[i][low - 1];
    }
    if (sum > r[i]) {
      return 0;
    }
  }
  return 1;
}
int main() {
  scanf("%s", a);
  cur = pool;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%s %d %d", cur, l + i, r + i);
    s[i] = cur;
    cur += strlen(s[i]) + 1;
  }
  buildSa();
  long long res = 0;
  int last = -1;
  for (int i = 0; i < m; i++) {
    if (sa[i] >= sz) {
      continue;
    }
    int minLen = 1;
    if (last >= 0) {
      minLen = getMin(last, i - 1) + 1;
    }
    int low = minLen - 1, high = sz - sa[i] + 1;
    while (high - low > 1) {
      int mid = (low + high) >> 1;
      if (checkHigh(mid, i)) {
        high = mid;
      } else {
        low = mid;
      }
    }
    int lowBound = high;
    low = minLen - 1, high = sz + 1 - sa[i];
    while (high - low > 1) {
      int mid = (low + high) >> 1;
      if (checkLow(mid, i)) {
        low = mid;
      } else {
        high = mid;
      }
    }
    int highBound = low;
    if (lowBound <= highBound) {
      res += highBound - lowBound + 1;
    }
    last = i;
  }
  cout << res << endl;
  return 0;
}

### Prompt

Please create a solution in Cpp 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 = 600010;
int n, m;
int l[N], r[N];
char a[N];
char pool[N], *s[N], *cur;
int sa[N], tmp[N], lcp[N], pos[N], len, sz;
int rmq[20][N];
char b[N];
int cnt[20][N];
bool cmp(int u, int v) {
  if (pos[u] != pos[v]) {
    return pos[u] < pos[v];
  }
  u += len;
  v += len;
  if (u < m && v < m) {
    return pos[u] < pos[v];
  }
  return u > v;
}
int c[N];
void stupidSort(int add) {
  memset(c, 0, sizeof c);
  for (int i = 0; i < m; i++) {
    c[i + add >= m ? 0 : pos[i + add]]++;
  }
  for (int i = 1; i < N; i++) {
    c[i] += c[i - 1];
  }
  for (int i = m - 1; i >= 0; i--) {
    int id = sa[i];
    tmp[--c[id + add >= m ? 0 : pos[id + add]]] = id;
  }
  for (int i = 0; i < m; i++) {
    sa[i] = tmp[i];
  }
}
void buildSa() {
  sz = strlen(a);
  for (int i = 0; i < sz; i++) {
    b[i] = a[i];
  }
  b[sz] = '#';
  int curMem = sz;
  for (int i = 1; i <= n; i++) {
    int szNow = strlen(s[i]);
    for (int j = 0; j < szNow; j++) {
      b[++curMem] = s[i][j];
    }
    b[++curMem] = '#';
  }
  m = strlen(b);
  for (int i = 0; i < m; i++) {
    sa[i] = i;
    pos[i] = b[i];
  }
  len = 1;
  while (1) {
    stupidSort(len);
    stupidSort(0);
    tmp[0] = 1;
    for (int i = 1; i < m; i++) {
      tmp[i] = tmp[i - 1] + cmp(sa[i - 1], sa[i]);
    }
    for (int i = 0; i < m; i++) {
      pos[sa[i]] = tmp[i];
    }
    if (tmp[m - 1] == m) {
      break;
    }
    len <<= 1;
  }
  for (int i = 0; i < m; i++) {
    pos[i]--;
  }
  len = 0;
  for (int i = 0; i < m; i++) {
    if (pos[i] == m - 1) {
      continue;
    }
    int u = sa[pos[i] + 1];
    while (b[i + len] == b[u + len]) {
      len++;
    }
    lcp[pos[i]] = len;
    if (len) {
      len--;
    }
  }
  for (int i = 0; i < m - 1; i++) {
    rmq[0][i] = lcp[i];
  }
  for (int i = 1; i < 20; i++) {
    for (int j = 0; j < m - (1 << i); j++) {
      rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    }
  }
  for (int i = 0; i < sz; i++) {
    cnt[0][pos[i]] = 1;
  }
  curMem = sz;
  for (int i = 1; i <= n; i++) {
    int szNow = strlen(s[i]);
    for (int j = 0; j < szNow; j++) {
      cnt[i][pos[++curMem]] = 1;
    }
    curMem++;
  }
  for (int i = 0; i <= n; i++) {
    for (int j = 1; j < m; j++) {
      cnt[i][j] += cnt[i][j - 1];
    }
  }
}
int getMin(int l, int r) {
  int h = log2(r - l + 1);
  return min(rmq[h][l], rmq[h][r - (1 << h) + 1]);
}
void getPos(int &l, int &r, int u, int id) {
  int low = -1, high = id;
  while (high - low > 1) {
    int mid = (low + high) >> 1;
    if (getMin(mid, id - 1) >= u) {
      high = mid;
    } else {
      low = mid;
    }
  }
  l = high;
  low = id, high = m - 1;
  while (high - low > 1) {
    int mid = (high + low) >> 1;
    if (getMin(id, mid - 1) >= u) {
      low = mid;
    } else {
      high = mid;
    }
  }
  r = low;
}
bool checkLow(int u, int id) {
  int low, high;
  getPos(low, high, u, id);
  for (int i = 1; i <= n; i++) {
    int sum = cnt[i][high];
    if (low) {
      sum -= cnt[i][low - 1];
    }
    if (sum < l[i]) {
      return 0;
    }
  }
  return 1;
}
bool checkHigh(int u, int id) {
  int low, high;
  getPos(low, high, u, id);
  for (int i = 1; i <= n; i++) {
    int sum = cnt[i][high];
    if (low) {
      sum -= cnt[i][low - 1];
    }
    if (sum > r[i]) {
      return 0;
    }
  }
  return 1;
}
int main() {
  scanf("%s", a);
  cur = pool;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%s %d %d", cur, l + i, r + i);
    s[i] = cur;
    cur += strlen(s[i]) + 1;
  }
  buildSa();
  long long res = 0;
  int last = -1;
  for (int i = 0; i < m; i++) {
    if (sa[i] >= sz) {
      continue;
    }
    int minLen = 1;
    if (last >= 0) {
      minLen = getMin(last, i - 1) + 1;
    }
    int low = minLen - 1, high = sz - sa[i] + 1;
    while (high - low > 1) {
      int mid = (low + high) >> 1;
      if (checkHigh(mid, i)) {
        high = mid;
      } else {
        low = mid;
      }
    }
    int lowBound = high;
    low = minLen - 1, high = sz + 1 - sa[i];
    while (high - low > 1) {
      int mid = (low + high) >> 1;
      if (checkLow(mid, i)) {
        low = mid;
      } else {
        high = mid;
      }
    }
    int highBound = low;
    if (lowBound <= highBound) {
      res += highBound - lowBound + 1;
    }
    last = i;
  }
  cout << res << endl;
  return 0;
}

```