#include <iostream> #include <cstring> #include <algorithm> #include <vector> using namespace std; int n, m, q; vector<string> strs; int find(string pattern, string text) { int n = pattern.size(); int m = text.size(); if (n > m) return 0; int count = 0; vector<int> next(n + 1, 0); for (int i = 1; i < n; i++) { int j = i; while (j > 0) { j = next[j]; if (pattern[j] == pattern[i]) { next[i + 1] = j + 1; break; } } } vector<int> positions; for (int i = 0, j = 0; i < m; i++) { if (j < n && text[i] == pattern[j]) { j++; } else { while (j > 0) { j = next[j]; if (text[i] == pattern[j]) { j++; break; } } } if (j == n) { positions.push_back(i - n + 1); count++; } } return count; } int main() { cin >> n >> m; while (n--) { string str; cin >> str; strs.push_back(str); } cin >> q; while (q--) { string str1; cin >> str1; int sum = 0; for (int i = 0; i < strs.size(); i++) { sum += find(str1, strs[i]); } cout << sum << endl; } return 0; }