#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <string>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define All(v) (v).begin(),(v).end()
typedef long long ll;

const int MAX = 500000,MS=2;
const ll mod[] = {999999937LL, 1000000007LL}, base = 9973;
struct rolling_hash{
    int n;
    vector<ll> hs[MS],pw[MS];
    rolling_hash(){};
    rolling_hash(const string &s){
        n=s.size();
        for(int i=0;i<MS;i++){
            hs[i].assign(n+1,0);
            pw[i].assign(n+1,0);
            hs[i][0]=0;
            pw[i][0]=1;
            for(int j=0;j<n;j++){
                pw[i][j+1] = pw[i][j]*base%mod[i];
                hs[i][j+1] = (hs[i][j]*base+s[j])%mod[i];
            }
        }
    }
    ll get_hash(int l,int r,int i){
        return ((hs[i][r]-hs[i][l]*pw[i][r-l])%mod[i]+mod[i])%mod[i];
    }
};

int main(){
    string S;
    cin >> S;
    int N = S.size();
    rolling_hash rh(S);
    map<pair<ll,ll>,ll> m[11];
    for(int i=0;i<N;i++){
        for(int j=0;j<10;j++){
            if(i+j>=N)break;
            m[j+1][make_pair(rh.get_hash(i,i+j+1,0),rh.get_hash(i,i+j+1,1))]++;
        }
    }
    int M;
    cin >> M;
    ll res = 0;
    rep(i,M){
        string C;
        cin >> C;
        rolling_hash cur(C);
        res+=m[C.size()][make_pair(cur.get_hash(0,C.size(),0),cur.get_hash(0,C.size(),1))];
    }

    cout << res << endl;
    return 0;
}