#include <bits/stdc++.h>
using namespace std;
int Get() {
  char c;
  while (c = getchar(), (c < '0' || c > '9') && (c != '-'))
    ;
  bool Flag = (c == '-');
  if (Flag) c = getchar();
  int X = 0;
  while (c >= '0' && c <= '9') {
    X = X * 10 + c - 48;
    c = getchar();
  }
  return Flag ? -X : X;
}
void Output(int X) {
  if (X < 0) {
    putchar('-');
    X = -X;
  }
  int Len = 0, Data[10];
  while (X) {
    Data[Len++] = X % 10;
    X /= 10;
  }
  if (!Len) Data[Len++] = 0;
  while (Len--) putchar(Data[Len] + 48);
  putchar('\n');
}
const int Base = 19961021;
long long Hash[11][2001];
long long Pow[2001];
long long GetHash(int P, int X, int Len) {
  return Hash[P][X + Len] - Hash[P][X] * Pow[Len];
}
int main() {
  string S[11];
  cin >> S[0];
  int N = Get();
  static int LB[11], UB[11];
  for (int i = 1; i <= N; i++) cin >> S[i] >> LB[i] >> UB[i];
  for (int i = 0; i <= N; i++) {
    Hash[i][0] = 0;
    for (int j = 0; j < S[i].size(); j++)
      Hash[i][j + 1] = Hash[i][j] * Base + S[i][j];
  }
  Pow[0] = 1;
  for (int i = 0; i < 2000; i++) Pow[i + 1] = Pow[i] * Base;
  int Total = 0;
  static long long Ans[2000000];
  for (int i = 0; i < S[0].size(); i++) {
    static int Sum[11][2001];
    memset(Sum, 0, sizeof(Sum));
    for (int j = 1; j <= N; j++)
      for (int k = 0; k < S[j].size(); k++) {
        int Left = 0, Right = min(S[0].size() - i, S[j].size() - k);
        while (Left < Right) {
          int Mid = (Left + Right + 1) / 2;
          if (GetHash(0, i, Mid) == GetHash(j, k, Mid))
            Left = Mid;
          else
            Right = Mid - 1;
        }
        Sum[j][Left]++;
      }
    for (int j = 1; j <= N; j++)
      for (int k = S[0].size() - i; k >= 1; k--) Sum[j][k - 1] += Sum[j][k];
    for (int j = 1; j <= S[0].size() - i; j++) {
      bool OK = true;
      for (int k = 1; k <= N; k++)
        if (Sum[k][j] < LB[k] || Sum[k][j] > UB[k]) OK = false;
      if (OK) Ans[Total++] = GetHash(0, i, j);
    }
  }
  sort(Ans, Ans + Total);
  int Count = 0;
  for (int i = 0; i < Total; i++)
    if (!i || Ans[i] != Ans[i - 1]) Count++;
  Output(Count);
  return 0;
}
