#include <bits/stdc++.h>
using namespace std;
const int N = 5e4 + 9;
struct Node {
  int next[26];
  int dep, fail;
  void clear() {
    memset(next, 0, sizeof(next));
    dep = fail = 0;
  }
};
int dp[10][N * 11];
int chef[N * 11];
int sef[N * 11];
pair<int, int> limit[10];
struct SA {
  char s[N];
  Node a[N * 11];
  int sz, en;
  void init() {
    fill(a[0].next, a[0].next + 26, 1);
    a[0].dep = -1;
    en = sz = 1;
    a[sz++].clear();
  }
  void build() {
    init();
    for (int i = 0; s[i]; i++) {
      int key = s[i] - 'a';
      int p = sz++;
      a[p].clear();
      a[p].dep = a[en].dep + 1;
      sef[p] = 1;
      while (!a[en].next[key]) a[en].next[key] = p, en = a[en].fail;
      int p1 = a[en].next[key];
      if (a[en].dep + 1 == a[p1].dep)
        a[p].fail = p1;
      else {
        int p2 = sz++;
        a[p2] = a[p1];
        sef[p2] = 0;
        a[p].fail = a[p1].fail = p2;
        a[p2].dep = a[en].dep + 1;
        while (a[en].next[key] == p1) a[en].next[key] = p2, en = a[en].fail;
      }
      en = p;
    }
  }
  vector<int> to[N << 1];
  void dfs(int x, int ar[]) {
    for (int i = 0; i < to[x].size(); i++) {
      int t = to[x][i];
      dfs(t, ar);
      ar[x] += ar[t];
    }
  }
  void make_tree() {
    for (int i = 2; i < sz; i++) to[a[i].fail].push_back(i);
  }
  void run(char s[], int k) {
    int p = 1;
    for (int i = 0; s[i]; i++) {
      int key = s[i] - 'a';
      while (!a[p].next[key]) p = a[p].fail;
      int p1 = a[p].next[key];
      if (a[p].dep + 1 == a[p1].dep)
        p = p1;
      else {
        int p2 = sz++;
        a[p2] = a[p1];
        sef[p2] = 0;
        a[p2].dep = a[p].dep + 1;
        a[p1].fail = p2;
        while (a[p].next[key] == p1) a[p].next[key] = p2, p = a[p].fail;
        p = p2;
      }
      dp[k][p]++;
    }
  }
} A;
int n;
char ts[N];
int main() {
  scanf("%s", A.s);
  A.build();
  cin >> n;
  for (int i = 0; i < n; i++) {
    int k1, k2;
    scanf("%s%d%d", ts, &k1, &k2);
    limit[i] = make_pair(k1, k2);
    A.run(ts, i);
  }
  A.make_tree();
  for (int i = 0; i < n; i++) {
    A.dfs(1, dp[i]);
  }
  for (int i = 0; i < n; i++) {
    for (int j = 2; j < A.sz; j++)
      if (limit[i].first <= dp[i][j] && dp[i][j] <= limit[i].second)
        chef[j] |= 1 << i;
  }
  A.dfs(1, sef);
  long long ans = 0;
  for (int i = 2; i < A.sz; i++)
    if (chef[i] + 1 == (1 << n)) {
      ans += (A.a[i].dep - A.a[A.a[i].fail].dep);
    }
  cout << ans << endl;
  return 0;
}
