#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
const int maxk = 20;
const long long P = 1e9 + 7;
int n, k;
char s[maxn];
int l[maxn], r[maxn];
char p[maxk][maxn];
int lenp[maxk];
long long lkdfjldskfj[maxn];
long long hashp[maxk][maxn];
long long powers[maxn];
vector<int> pos[maxk], npos[maxk];
inline long long gethash(int l, int r) {
  return lkdfjldskfj[r] - lkdfjldskfj[l - 1] * powers[r - l + 1];
}
inline long long gethashp(int l, int r, int num) {
  return hashp[num][r] - hashp[num][l - 1] * powers[r - l + 1];
}
inline bool eq(int l, int r, int lp, int rp, int it) {
  return gethash(l + 1, r + 1) == gethashp(lp + 1, rp + 1, it);
}
int main() {
  powers[0] = 1;
  for (int i = 1; i < maxn; i++) powers[i] = powers[i - 1] * P;
  gets(s);
  n = strlen(s);
  lkdfjldskfj[0] = 0;
  for (int i = 0; i < n; i++) lkdfjldskfj[i + 1] = lkdfjldskfj[i] * P + s[i];
  scanf("%d\n", &k);
  for (int i = 0; i < k; i++) {
    scanf("%s%d%d", p[i], &l[i], &r[i]), lenp[i] = strlen(p[i]);
    hashp[i][0] = 0;
    for (int j = 0; j < lenp[i]; j++)
      hashp[i][j + 1] = hashp[i][j] * P + p[i][j];
  }
  set<long long> ans;
  for (int lp = 0; lp < n; lp++) {
    bool fail = 0;
    for (int i = 0; i < k; i++) {
      pos[i].clear();
      pos[i].resize(lenp[i]);
      for (int j = 0; j < lenp[i]; j++) pos[i][j] = j;
    }
    for (int rp = lp; rp < n && !fail; rp++) {
      long long h = gethash(lp + 1, rp + 1);
      if (ans.find(h) != ans.end()) continue;
      int len = rp - lp + 1;
      bool ok = 1;
      for (int it = 0; it < k; it++) {
        npos[it].clear();
        int cnt = 0;
        for (int i = 0; i < (int)pos[it].size(); i++)
          if (pos[it][i] + len <= lenp[it] &&
              eq(lp, rp, pos[it][i], pos[it][i] + len - 1, it)) {
            ++cnt, npos[it].push_back(pos[it][i]);
            if (cnt > r[it]) break;
          }
        if (cnt < l[it]) {
          ok = 0;
          fail = 1;
          break;
        }
        if (cnt > r[it]) {
          ok = 0;
          break;
        }
        pos[it].resize((int)npos[it].size());
        for (int i = 0; i < (int)npos[it].size(); i++) pos[it][i] = npos[it][i];
      }
      if (ok) {
        ans.insert(h);
      }
    }
  }
  printf("%d\n", (int)ans.size());
  return 0;
}
