#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007

class Trie {
public:
  vector<vector<int> > V;

  Trie() {
    V.pb(vector<int>(26+1));
  }

  int find(string s) {
    int cur = 0;
    for (char ch : s) {
      int c = ch - 'A';
      cur = V[cur][c+1];
      if (cur == 0) return -1;
    }
    return cur;
  }

  void insert(string s) {
    int cur = 0;
    for (char ch : s) {
      int c = ch - 'A';
      if (V[cur][c+1] == 0) {
        V[cur][c+1] = V.size();
        V.pb(vector<int>(26+1));
      }
      cur = V[cur][c+1];
    }
  }
};

class ACMatch {
public:
  Trie t;
  vector<int> acc;
  vector<string> S;

  void add_str(string s) {
    t.insert(s);
    S.pb(s);
  }

  void build() {
    acc.resize(t.V.size(), 0);
    for (string s : S) acc[t.find(s)]++;
    queue<int> q;
    rep(i, 26) {
      if (!t.V[0][i+1]) continue;
      t.V[t.V[0][i+1]][0] = 0;
      q.push(t.V[0][i+1]);
    }

    while (!q.empty()) {
      int k = q.front(); q.pop();
      rep(i, 26) {
        if (!t.V[k][i+1]) continue;
        q.push(t.V[k][i+1]);
        int pre = t.V[k][0];
        while (pre && t.V[pre][i+1]==0) pre = t.V[pre][0];
        t.V[t.V[k][i+1]][0] = t.V[pre][i+1];
        acc[t.V[k][i+1]] += acc[t.V[pre][i+1]];
      }
    }
  }

  int match(string S) {
    int sum = 0, cur = 0;
    for (char ch : S) {
      int c = ch - 'A';
      while (cur && t.V[cur][c+1]==0) cur=t.V[cur][0];
      cur = t.V[cur][c+1];
      sum += acc[cur];
    }
    return sum;
  }
};

string S;
int M;

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> S >> M;
  ACMatch acm;
  rep(i, M) {
    string s;
    cin >> s;
    acm.add_str(s);
  }
  acm.build();

  cout << acm.match(S) << "\n";
  return 0;
}