#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>

/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")
*/

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

int n, m;
set<string> ha;
map<string, set<int>> ra;

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    vector<string> a(n);
    int k;
    string s;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        k = a[i].size();
        if (k != 1) {
            ha.insert(a[i]);
            ra[a[i]].insert(i);
            for (int j = 0; j < k; j++) {
                s = a[i];
                s.erase(s.begin() + j);
                ha.insert(s);
                ra[s].insert(i);
            }
        } else {
            ha.insert("");
            ra[""].insert(i);
            ha.insert(a[i]);
            ra[a[i]].insert(i);
        }
    }
    string b;
    int cnt;
    set<int> ok;
    map<string, int> ans;
    map<string, bool> was;
    map<string, string> kkk;
    for (int i = 0; i < m; i++) {
        cin >> b;
        if (was[b]) {
            cout << b << " " << ans[b] << " " << kkk[b] << "\n";
            continue;
        }
        was[b] = 1;
        ok.clear();
        for (auto kk : ra[b]) {
            ok.insert(kk);
        }
        k = b.size();
        for (int j = 0; j < k; j++) {
            s = b;
            s.erase(s.begin() + j);
            for (auto kk : ra[s]) {
                ok.insert(kk);
            }
        }
        cnt = ok.size();
        ans[b] = cnt;
        if (cnt != 1) {
            cout << b << " " << cnt << "\n";
        } else {
            cout << b << " 1 " << a[*ok.begin()] << "\n";
            kkk[b] = a[*ok.begin()];
        }
    }
}
/*
*/