#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define ALL(x) (x).begin(), (x).end() #define BIT(n) (1LL<<(n)) #define SZ(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair;using vb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; template struct Trie { const int EMPTY = -1; vector> trie; vector vals; Trie() { assign_new_state(); } void add_word(const string& word, const V& val) { int now = 0; for (char c : word) { c -= 'A'; if (trie[now][c] == EMPTY) { trie[now][c] = SZ(trie); assign_new_state(); } now = trie[now][c]; } vals[now] = val; } void search(const string& sentence, function callback) { const int N = sentence.size(); for (int i = 0; i < N; i++) { int now = 0; for (int j = 0; i + j < N; j++) { int c = sentence[i + j] - 'A'; now = trie[now][c]; if (now == EMPTY) break; callback(i, j, vals[now]); } } } private: int now; void assign_new_state() { trie.emplace_back(26, EMPTY); vals.push_back(0); }; }; void Main() { string S; int M; cin >> S >> M; Trie trie; rep(i, M) { string s; cin >> s; trie.add_word(s, true); } int ans = 0; trie.search(S, [&ans](int i, int len, bool val) { if (val) { ans++; } }); cout << ans << endl; } int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }