швб_22-23_N5

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m; cin >> n >> m;
    string s = "";
    for (int i = 0; i < n; ++i) {
        string k; cin >> k;
        s += k;
    }
    int q; cin >> q;
    vector <pair <string, int> > ans;
    for (int go = 0; go < q; ++go) {
        string t; cin >> t;
        auto it = s.find(t);
        if (it == string::npos) {
            continue;
        }
        int in = 0;
        for (int i = 0; i <= n * m - t.size(); ++i) {
            string ch = s.substr(i, t.size());
            if (ch == t) {
                in++;
            }
        }
        ans.push_back({t, in});
    }
    sort(ans.begin(), ans.end());
    for (auto p: ans) {
        cout << p.first << ' ' << p.second  << "\n";
    }
}
 /*
 2 3
aba
bab
6
ababab
a
b
ab
aba
bab
*/