#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

struct RH {
	static int mod[2], mul[2];
    static vector<int> pm[2];
    int sz;
    vector<vector<int> > hs;
	RH(const string& s) : sz((int)s.size()), hs(2, vector<int>(sz + 1, 0)){
        for(int i = 0; i < 2; i++){
            if(pm[i].empty()) pm[i].push_back(1);
            for(int j = 0; j < sz; j++){
                hs[i][j+1] = ((long long)hs[i][j] * mul[i] + s[j]) % mod[i];
            }
        }
	}
	pair<int, int> hash(const int l, const int r){	//文字列sのインデックス [l,r) の部分文字列のハッシュ値
		if(l >= r) return make_pair(0, 0);
        int res[2];
        for(int i = 0; i < 2; i++){
            while((int)pm[i].size() <= r){
                pm[i].push_back((long long)pm[i].back() * mul[i] % mod[i]);
            }
            res[i] = (hs[i][r] - (long long)hs[i][l] * pm[i][r-l]) % mod[i] + mod[i];
            res[i] = (res[i] >= mod[i]) ? (res[i] - mod[i]) : res[i];
        }
		return make_pair(res[0], res[1]);
	}
    void contain(const string& pattern, vector<int>& pos){
        int length = (int)pattern.size();
        if(sz < length) return;
        RH rh(pattern);
        pair<int, int> _hash = rh.hash(0, length);
        for(int i = 0; i < sz - length + 1; i++){
    		if(hash(i, i + length) == _hash){
    			pos.push_back(i);
    		}
    	}
        return;
    }
};
vector<int> RH::pm[2];
int RH::mod[2] = {1000000007, 1000000009}, RH::mul[2] = {10009, 10007};

map<P, int> mp;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s;
    cin >> s;
    RH rh(s);
    srep(i,1,11){
        rep(j,len(s)-i+1){
            mp[rh.hash(j,i+j)]++;
        }
    }
    int n;
    cin >> n;
    int ans = 0;
    rep(i,n){
        cin >> s;
        vi pos;
        rh.contain(s, pos);
        ans += (int)pos.size();
    }
    cout << ans << "\n";
    return 0;
}