#pragma GCC target("avx") #pragma GCC optimize("Ofast") #include using namespace std; using ll=long long; using ld=long double; using ull=unsigned long long; using uint=unsigned int; using pcc=pair; using pii=pair; using pll=pair; using pdd=pair; using tuplis=pair; using tuplis2=pair; template using pq=priority_queue,greater>; const ll LINF=0x1fffffffffffffff; const ll MINF=0x7fffffffffff; const int INF=0x3fffffff; const ll MOD=1000000007; const ll MODD=998244353; const ld DINF=numeric_limits::infinity(); const ld EPS=1e-9; const vectorfour{0,1,0,-1,0}; #define _overload4(_1,_2,_3,_4,name,...) name #define _overload3(_1,_2,_3,name,...) name #define _rep1(n) for(ll i=0;i=0;i--) #define _rrep2(i,n) for(ll i=(n)-1;i>=0;i--) #define _rrep3(i,a,b) for(ll i=(b)-1;i>=a;i--) #define _rrep4(i,a,b,c) for(ll i=a+(b-a-1)/c*c;i>=a;i-=c) #define rrep(...) _overload4(__VA_ARGS__,_rrep4,_rrep3,_rrep2,_rrep1)(__VA_ARGS__) #define each(i,a) for(auto &i:a) #define sum(...) accumulate(range(__VA_ARGS__),0LL) #define dsum(...) accumulate(range(__VA_ARGS__),double(0)) #define _range(i) (i).begin(),(i).end() #define _range2(i,k) (i).begin(),(i).begin()+k #define _range3(i,a,b) (i).begin()+a,(i).begin()+b #define range(...) _overload3(__VA_ARGS__,_range3,_range2,_range)(__VA_ARGS__) #define _rrange(i) (i).rbegin(),(i).rend() #define _rrange2(i,k) (i).rbegin(),(i).rbegin()+k #define _rrange3(i,a,b) (i).rbegin()+a,(i).rbegin()+b #define rrange(...) _overload3(__VA_ARGS__,_rrange3,_rrange2,_rrange)(__VA_ARGS__) #define elif else if #define unless(a) if(!(a)) #define mp make_pair #define mt make_tuple #define INT(...) int __VA_ARGS__;in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;in(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__) #define STR(...) string __VA_ARGS__;in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__;in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__;in(__VA_ARGS__) #define vec(type,name,...) vector name(__VA_ARGS__) #define VEC(type,name,size) vector name(size);in(name) #define vv(type,name,h,...) vector>name(h,vector(__VA_ARGS__)) #define VV(type,name,h,...) vector>name(h,vector(__VA_ARGS__));in(name) #define vvv(type,name,h,w,...) vector>>name(h,vector>(w,vector(__VA_ARGS__))) inline constexpr ll gcd(ll a,ll b){if(!a||!b)return 0;while(b){ll c=b;b=a%b;a=c;}return a;} inline constexpr ll lcm(ll a,ll b){if(!a||!b)return 0;return a*b/gcd(a,b);} template inline constexpr T min(vector &v){return *min_element(range(v));} inline char min(string &v){return *min_element(range(v));} template inline constexpr T max(vector &v){return *max_element(range(v));} inline char max(string &v){return *max_element(range(v));} inline constexpr ll intpow(ll a,ll b){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;}a*=a;}return ans;} inline constexpr ll modpow(ll a,ll b,ll mod = MOD){ll ans=1;for(ll i=1;b;i*=2){if(b&i){b^=i;ans*=a;ans%=mod;}a*=a;a%=mod;}return ans;} template inline constexpr bool chmin(T &mn,const T &cnt){if(mn>cnt){mn=cnt;return 1;}else return 0;} template inline constexpr bool chmax(T &mx,const T &cnt){if(mx unordered_map press(vector &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); unordered_map ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; } template map press_map(vector &a){ auto b = a; sort(range(b)); b.erase(unique(range(b)), b.end()); map ans; rep(b.size()) ans[b[i]] = i; each(i, a) i = ans[i]; return ans; } inline int scan(){ return getchar(); } inline void scan(int &a){ scanf("%d", &a); } inline void scan(unsigned &a){ scanf("%u", &a); } inline void scan(long &a){ scanf("%ld", &a); } inline void scan(long long &a){ scanf("%lld", &a); } inline void scan(unsigned long long &a){ scanf("%llu", &a); } inline void scan(char &a){ cin >> a; } inline void scan(float &a){ scanf("%f", &a); } inline void scan(double &a){ scanf("%lf", &a); } inline void scan(long double &a){ scanf("%Lf", &a); } inline void scan(vector &vec){ for(unsigned i = 0; i < vec.size(); i++) { int a; scan(a); vec[i] = a; } } inline void scan(string &a){ cin >> a; } template inline void scan(vector &vec); template inline void scan(array &vec); template inline void scan(pair &p); template inline void scan(T (&vec)[size]); template inline void scan(vector &vec){ for(auto &i : vec) scan(i); } template inline void scan(array &vec){ for(auto &i : vec) scan(i); } template inline void scan(pair &p){ scan(p.first); scan(p.second); } template inline void scan(T (&vec)[size]){ for(auto &i : vec) scan(i); } template inline void scan(T &a){ cin>>a; } inline void in(){} template inline void in(Head &head, Tail&... tail){ scan(head); in(tail...); } inline void print(){ putchar(' '); } inline void print(const bool &a){ printf("%d", a); } inline void print(const int &a){ printf("%d", a); } inline void print(const unsigned &a){ printf("%u", a); } inline void print(const long &a){ printf("%ld", a); } inline void print(const long long &a){ printf("%lld", a); } inline void print(const unsigned long long &a){ printf("%llu", a); } inline void print(const char &a){ printf("%c", a); } inline void print(const char a[]){ printf("%s", a); } inline void print(const float &a){ printf("%.10f", a); } inline void print(const double &a){ printf("%.10f", a); } inline void print(const long double &a){ printf("%.10Lf", a); } template void print(const vector &vec); template void print(const array &vec); template void print(const pair &p); template inline void print(const T (&vec)[size]); template void print(const vector &vec){ if(vec.empty()) return; print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } } template void print(const array &vec){ print(vec[0]); for(auto i = vec.begin(); ++i != vec.end(); ){ putchar(' '); print(*i); } } template void print(const pair &p){ print(p.first); putchar(' '); print(p.second); } template inline void print(const T (&vec)[size]){ print(vec[0]); for(auto i = vec; ++i != end(vec); ){ putchar(' '); print(*i); } } template inline void print(const T &a){ cout << a; } inline int out(){ putchar('\n'); return 0; } template inline int out(const T &t){ print(t); putchar('\n'); return 0; } template inline int out(const Head &head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; } template inline void err(T t){cerr<(chrono::system_clock::now().time_since_epoch()).count() & 63]; struct RollingHash { vector hashed, power; static constexpr ull mask(int a) { return (1ull << a) - 1; } inline ull mul(ull a, ull b) const { //* __uint128_t ans = __uint128_t(a) * b; /*/ // without __uint128_t ull a31 = a >> 31, b31 = b >> 31; a &= mask(31); b &= mask(31); ull x = a * b31 + b * a31; ull ans = (a31 * b31 << 1) + (x >> 30) + ((x & mask(30)) << 31) + a * b; //*/ ans = (ans >> 61) + (ans & mask(61)); if(ans >= mod) ans -= mod; return ans; } RollingHash(const string &s) { ll n = s.size(); hashed.assign(n + 1, 0); power.assign(n + 1, 0); power[0] = 1; rep(n) { power[i + 1] = mul(power[i], base); hashed[i + 1] = mul(hashed[i], base) + s[i]; if(hashed[i + 1] >= mod) hashed[i + 1] -= mod; } } ull get(ll l, ll r) const { ull ret = hashed[r] + mod - mul(hashed[l], power[r - l]); if(ret >= mod) ret -= mod; return ret; } ull connect(ull h1, ll h2, ll h2len) const { ull ret = mul(h1, power[h2len]) + h2; if(ret >= mod) ret -= mod; return ret; } void connect(const string &s){ ll n = hashed.size() - 1, m = s.size(); hashed.resize(n + m + 1); power.resize(n + m + 1); rep(i, n, n + m) { power[i + 1] = mul(power[i], base); hashed[i + 1] = mul(hashed[i], base) + s[i - n]; if(hashed[i + 1] >= mod) hashed[i + 1] -= mod; } } ll LCP(const RollingHash &b, ll l1, ll r1, ll l2, ll r2) { ll len = min(r1 - l1, r2 - l2); ll low = -1, high = len + 1; while(high - low > 1) { ll mid = (low + high) / 2; if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid; else high = mid; } return low; } }; signed main(){ STR(s); RollingHash rh(s); LL(m); ll ans=0; rep(m){ STR(t); __uint128_t rh2=0; each(i,t){ rh2*=base; rh2=(rh2>>61)+(rh2&RollingHash::mask(61)); rh2+=i; if(rh2>=mod)rh2-=mod; } rep(i,t.size(),s.size()+1)ans+=rh.get(i-t.size(),i)==rh2; } out(ans); }