#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;

string s;
int n, l, r, mid;
vector<vector<int>> ah, bh;
vector<set<int>> sla, slb;
vector<int> pw(100001);

inline int subh(vector<int>& h, int l, int r) {
    int big = h[r], small = 0;
    if (l > 0) {
        small = (h[l - 1] * pw[r - l + 1]) % mod;
    }
    return (big - small + mod) % mod;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    freopen("input.in", "r", stdin);
//    freopen("output.out", "w", stdout);
    pw[0] = 1;
    for (int i = 1; i < 100001; i++) {
        pw[i] = (pw[i - 1] * p) % mod;
    }
    int n, m;
    cin >> n >> m;
    ah.resize(n);
    bh.resize(m);
    sla.resize(n);
    slb.resize(m);
    vector<string> a(n), b(m);
    int q;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        q = a[i].size();
        ah[i].resize(q);
        ah[i][0] = a[i][0] - 'a' + 1;
        for (int j = 1; j < q; j++) {
            ah[i][j] = ((ah[i][j - 1] * p) % mod + a[i][j] - 'a' + 1) % mod;
        }
        if (q == 1) {
            sla[i].insert(0);
            sla[i].insert(ah[i][0]);
            continue;
        }
//        cout << q << "\n";
//        cout << a[i] << "\n";
//        cout << ah[i].size() << "\n";
        sla[i].insert(ah[i][q - 1]);
//        cout << "1: " << ah[i][q - 1] << "\n";
        sla[i].insert(ah[i][q - 2]);
//        cout << "2: " << ah[i][q - 2] << "\n";
        sla[i].insert(subh(ah[i], 1, q - 1));
//        cout << "3: "<< subh(ah[i], 1, q - 1) << "\n";
        for (int j = 1; j < q - 1; j++) {
//            cout << "here\n";
//            cout << ah[i].size() << " " << 0 << " " << i - 1 << "\n" << i + 1 << " " << q - 1 << "\n";
            sla[i].insert((subh(ah[i], j + 1, q - 1) + (subh(ah[i], 0, j - 1) * pw[q-1-j]) % mod) % mod);
        }
    }
    for (int i = 0; i < m; i++) {
        cin >> b[i];
        q = b[i].size();
        bh[i].resize(q);
        bh[i][0] = b[i][0] - 'a' + 1;
        for (int j = 1; j < q; j++) {
            bh[i][j] = ((bh[i][j - 1] * p) % mod + b[i][j] - 'a' + 1) % mod;
        }
        if (q == 1) {
            slb[i].insert(0);
            slb[i].insert(bh[i][0]);
        } else {
        slb[i].insert(bh[i][q - 1]);
        slb[i].insert(bh[i][q - 2]);
        slb[i].insert(subh(bh[i], 1, q - 1));
        for (int j = 1; j < q - 1; j++) {
            slb[i].insert((subh(bh[i], j + 1, q - 1) + (subh(bh[i], 0, j - 1) * pw[q-1-j]) % mod) % mod);
        }}
        int cnt = 0;
        string ans;
        for (int j = 0; j < n; j++) {
            set<int> k;
            set_intersection(all(sla[j]), all(slb[i]), inserter(k, k.begin()));
//            cout << k.size() << "\n";
//            if (k.size() == 0) {
//                for (auto q : sla[j]) cout << q << " ";
//                cout << "\n";
//                for (auto q : slb[i]) cout << q << " ";
//                cout << "\n";
//            }
            if (k.size() > 0) {
                cnt++;
                ans = a[j];
            }
        }
        if (cnt != n) {
            cout << "\nBAD\n";
//            return 1;
        }
        cout << "OK\n";
//        return 0;
//        if (cnt == 1) {
//            cout << b[i] << " 1 " << ans << "\n";
//        } else {
//            cout << b[i] << " " << cnt << "\n";
//        }
    }

}