#include <bits/stdc++.h>
using namespace std;
char m[12][2100];
int h1[12][2100], h2[12][2100], p1[2100], p2[2100], a[12], b[12];
set<long long> s;
long long hs[12][10007 + 1000];
int hv[12][10007 + 1000], vs, v[12][10007 + 1000], len[12];
long long gethash(int k, int i, int j) {
  int t1 = ((long long)(h1[k][j] - h1[k][i]) * p1[2100 - 1 - j] % 1000000009 +
            1000000009) %
           1000000009;
  int t2 = ((long long)(h2[k][j] - h2[k][i]) * p2[2100 - 1 - j] % 726731231 +
            726731231) %
           726731231;
  return (long long)t1 * 7326731231 + t2;
}
void add(int k, long long t) {
  int i;
  for (i = t % 10007; v[k][i] == vs && hs[k][i] != t; i++)
    ;
  if (v[k][i] == vs)
    hv[k][i]++;
  else {
    v[k][i] = vs;
    hs[k][i] = t;
    hv[k][i] = 1;
  }
}
int get(int k, long long t) {
  int i;
  for (i = t % 10007; v[k][i] == vs && hs[k][i] != t; i++)
    ;
  if (v[k][i] == vs)
    return hv[k][i];
  else
    return 0;
}
int main() {
  int i, j, l, r, n, t;
  long long k;
  for (p1[0] = 1, i = 1; i < 2100;
       p1[i] = (long long)p1[i - 1] * 123121 % 1000000009, i++)
    ;
  for (p2[0] = 1, i = 1; i < 2100;
       p2[i] = (long long)p2[i - 1] * 717713 % 726731231, i++)
    ;
  for (scanf("%s%d", &m[0], &n), i = 1; i <= n;
       scanf("%s%d%d", m[i], &a[i], &b[i]), i++)
    ;
  for (i = 0; i <= n; len[i] = strlen(m[i]), i++) {
    for (j = 0; m[i][j];
         h1[i][j + 1] = (h1[i][j] + (long long)p1[j] * m[i][j]) % 1000000009,
        j++)
      ;
    for (j = 0; m[i][j];
         h2[i][j + 1] = (h2[i][j] + (long long)p2[j] * m[i][j]) % 726731231,
        j++)
      ;
  }
  vs = 1;
  for (r = 0, l = 1; l <= len[0]; vs++, l++) {
    s.clear();
    for (i = 1; i <= n; i++)
      for (j = 0; j + l <= len[i]; add(i, gethash(i, j, j + l)), j++)
        ;
    for (j = 0; j + l <= len[0]; j++) {
      k = gethash(0, j, j + l);
      if (s.find(k) != s.end()) continue;
      for (i = 1; i <= n; i++) {
        t = get(i, k);
        if (t < a[i] || t > b[i]) break;
      }
      if (i > n) s.insert(k);
    }
    r += s.size();
  }
  printf("%d\n", r);
  return 0;
}
