#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

template<typename TKEY>
struct TrieTree{
    int value;
    map<TKEY,TrieTree> trie;
    TrieTree(int v):value(v){}
    TrieTree():value(0){}
    
    template<typename IBEGIN,typename IBACK>
    int& operator()(IBEGIN begin,IBACK back){
        if (begin==back){
            return trie[*begin].value;
        }
        return trie[*begin](begin+1,back);
    }
};

int main(){
    int i,j,k,l;
    
    TrieTree<char> trie;
    string str;
    
    cin >> str;
    
    const char* strbyte = str.c_str();
    
    for (i=0;i<str.size();i++){
        for (j=0;j<10&&(j<=i);j++){
            trie(strbyte+i-j,strbyte+i)++;
        }
    }
    
    int n,sum=0;
    cin >> n;
    for (i=0;i<n;i++){
        cin >> str;
        sum+=trie(str.c_str(),str.c_str()+str.size()-1);
    }
    
    cout << sum << endl;
    
    return 0;
}