#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define elif else if #define sp(x) fixed << setprecision(x) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() using ll = long long; using ld = long double; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const ll MOD = 1e9+7; //const ll MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; const ld EPS = 1e-10; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; using ull = unsigned long long; template struct Rolling_Hash{ ull mod = (1UL<<61)-1; vector hashed, pw; ull mul(ull a, ull b) const{ ull a1 = a>>31, a2 = a&((1UL<<31)-1); ull b1 = b>>31, b2 = b&((1UL<<31)-1); ull ret = 2*a1*b1+a2*b2, c = a1*b2+a2*b1; ull c1 = c>>30, c2 = c&((1UL<<30)-1); ret += c1 + (c2<<31); ret = (ret>>61) + ret&mod; if(ret >= mod) ret -= mod; return ret; } Rolling_Hash(const string &s){ int n = sz(s); hashed.assign(n+1, 0); pw.assign(n+1, 0); pw[0] = 1; rep(i, n){ pw[i+1] = mul(pw[i], base); hashed[i+1] = mul(hashed[i], base)+s[i]; if(hashed[i+1] >= mod) hashed[i+1] -= mod; } } ull get(int l, int r) const{ ull ret = hashed[r]+mod-mul(hashed[l], pw[r-l]); if(ret >= mod) ret -= mod; return ret; } }; using RH = Rolling_Hash; int main(){ string S; cin >> S; int N = sz(S); int M; cin >> M; vector hash[11]; RH rh(S); rep2(i, 1, 10){ rep(j, N-i+1){ hash[i].pb(rh.get(j, j+i)); } } rep2(i, 1, 10) sort(all(hash[i])); int ans = 0; rep(i, M){ string C; cin >> C; int n = sz(C); RH tmp(C); ull h = tmp.get(0, n); ans += upper_bound(all(hash[n]), h) - lower_bound(all(hash[n]), h); } cout << ans << endl; }