import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum E = 26;

string S;
int M;
string[] C;

int V;
int[][] next;
int[] fail;
int[] ac;

int newNode() {
  next ~= new int[E];
  next[$ - 1][] = -1;
  fail ~= -1;
  ac ~= 0;
  return V++;
}

void bfs() {
  int[] q;
  q ~= 0;
  for (; !q.empty; ) {
    const u = q.front;
    q.popFront;
    foreach (e; 0 .. E) {
      const v = next[u][e];
      const w = (u == 0) ? 0 : next[fail[u]][e];
      if (v == -1) {
        next[u][e] = w;
      } else {
        fail[v] = w;
        ac[v] += ac[fail[v]];
        q ~= v;
      }
    }
  }
}

void main() {
  try {
    for (; ; ) {
      S = readToken();
      M = readInt();
      C = new string[M];
      foreach (i; 0 .. M) {
        C[i] = readToken();
      }
      
      V = 0;
      next = [];
      fail = [];
      ac = [];
      newNode();
      foreach (i; 0 .. M) {
        int u = 0;
        foreach (c; C[i]) {
          const e = c - 'A';
          if (next[u][e] == -1) {
            next[u][e] = newNode();
          }
          u = next[u][e];
        }
        ++ac[u];
      }
      bfs();
      
      long ans;
      {
        int u = 0;
        foreach (c; S) {
          const e = c - 'A';
          u = next[u][e];
          ans += ac[u];
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}