#include using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- struct RollingHash { static const ll mo0=1000000007,mo1=1000000009; static ll mul0,mul1; static const ll add0=1000010007, add1=1003333331; static vector pmo[2]; string s; int l; vector hash_[2]; void init(string s) { this->s=s; l=s.size(); int i,j; hash_[0]=hash_[1]=vector(1,0); if(!mul0) mul0=10009+(((ll)&mul0)>>5)%259,mul1=10007+(((ll)&mul1)>>5)%257; if(pmo[0].empty()) pmo[0].push_back(1),pmo[1].push_back(1); FOR(i,l) hash_[0].push_back((hash_[0].back()*mul0+add0+s[i])%mo0); FOR(i,l) hash_[1].push_back((hash_[1].back()*mul1+add1+s[i])%mo1); } pair hash(int l,int r) { // s[l..r] if(l>r) return make_pair(0,0); while(pmo[0].size() hash(string s) { init(s); return hash(0,s.size()-1); } static pair concat(pair L,pair R,int RL) { // hash(L+R) RL=len-of-R while(pmo[0].size() RollingHash::pmo[2]; ll RollingHash::mul0,RollingHash::mul1; string S; int M; string C; void solve() { int i,j,k,l,r,x,y; string s; int ret=0; cin>>S>>M; RollingHash rhs; rhs.init(S); while(M--) { cin>>s; RollingHash rh; auto p=rh.hash(s); for(x=0;x+s.size()<=S.size();x++) { if(rhs.hash(x,x+s.size()-1)==p) ret++; } } cout<