#define _USE_MATH_DEFINES #define _CRT_SECURE_NO_WARNINGS #include using namespace std; // #define int long long #define pb(x) push_back(x) #define m0(x) memset((x), 0, sizeof(x)) #define mm(x) memset((x), -1, sizeof(x)) //container #define ALL(x) (x).begin(), (x).end() #define RALL(a) (a).rbegin(), (a).rend() #define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i) #define EXIST(s, e) ((s).find(e) != (s).end()) #define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end()); #define PERM(c) \ sort(ALL(c)); \ for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c))) // debug #define GET_VAR_NAME(variable) #variable #define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl; // bit_macro #define bit(n) (1LL << (n)) #define bitset(a, b) (a) |= (1 << (b)) #define bitunset(a, b) (a) |= ~(1 << (b)) #define bitcheck(a, b) ((((a) >> (b)) & 1) == 1) #define bitcount(a) __builtin_popcountll((a)) //typedef typedef long long lint; typedef unsigned int ull; typedef complex Complex; typedef pair P; typedef tuple TP; typedef vector vec; typedef vector mat; //constant const int INF = (int)1e18; const int MOD = (int)1e9 + 7; const double EPS = (double)1e-10; const int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1}; const int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1}; // template void chmax(T &a, T b) { a = max(a, b); } template void chmin(T &a, T b) { a = min(a, b); } // inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } // struct Accelerate_Cin { Accelerate_Cin() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20); }; }; struct RollingHash { const ull B = 813297308; //基数 1 ~ M1-1 までの乱数 const ull M[3] = {999999937, 1000000007, 1000000009}; //bにaはいくつ含まれているか? int contain(string a, string b) { int al = a.length(), bl = b.length(); if (al > bl) return false; //B^al ull t[3]; for (int i = 0; i < 3; i++) { t[i] = 1; for (int j = 0; j < al; j++) t[i] = (t[i] * B) % M[i]; } //a,bの最初のal文字のハッシュ ull ah[3], bh[3]; for (int i = 0; i < 3; i++) { ah[i] = bh[i] = 0; for (int j = 0; j < al; j++) ah[i] = ((ah[i] * B) % M[i] + a[j]) % M[i]; for (int j = 0; j < al; j++) bh[i] = ((bh[i] * B) % M[i] + b[j]) % M[i]; } int cont = 0; for (int i = 0; i + al <= bl; i++) { bool flag = true; for (int j = 0; j < 3; j++) { if (ah[j] != bh[j]) flag = false; if (i + al < bl) { bh[j] = (bh[j] * B) % M[j] + (b[i + al] - (b[i] * t[j]) % M[j] + M[j]) % M[j]; bh[j] %= M[j]; } } if (flag) cont++; } return cont; } }; signed main() { string s; cin >> s; int M; cin >> M; RollingHash roll; int ans = 0; for (int i = 0; i < M; i++) { string c; cin >> c; ans += roll.contain(c, s); } cout << ans << endl; return 0; }