#include <bits/stdc++.h>
using namespace std;
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
void reads(string& second) {
  string ans = "";
  char c = '\n';
  while (c == '\n' || c == ' ') c = getchar();
  while (c != '\n' && c != ' ' && c) ans += c, c = getchar();
  second = ans;
}
const int inf = 1e9;
const double eps = 1e-9;
const int maxn = 2e6 + 10;
long long base = (long long)1e12 + 7;
const long long llinf = 1e18 + 1;
template <typename T>
T binpow(T n, T second) {
  if (second <= 0) return 1LL;
  if (second % 2 == 0) {
    T b = binpow(n, second / 2);
    return (1LL * b * b) % base;
  } else {
    return (1LL * binpow(n, second - 1) * n) % base;
  }
}
long long d[maxn], p = 29;
set<pair<long long, int> > bd;
map<pair<long long, int>, int> sot;
int mda[maxn];
bool good[maxn];
long long add(long long a, long long b) { return (a + b) % base; }
long long mult(long long a, long long b) {
  long long ans = 0;
  while (b) {
    if (b % 2) ans = (ans + a) % base;
    a = (a + a) % base;
    b /= 2;
  }
  return ans;
}
int main() {
  d[0] = 1;
  for (int i = 1; i < maxn; i++) d[i] = mult(d[i - 1], p);
  long long cur_hash = 0;
  int n, k;
  read(n, k);
  string second;
  reads(second);
  deque<int> window;
  second += second;
  for (int i = (int)second.size() - 1; i >= 0; i--) {
    if (window.size() == k) {
      int last = window.back();
      cur_hash = (1LL * cur_hash - mult(last, d[k - 1])) % base;
      if (cur_hash < 0) cur_hash += base;
      window.pop_back();
    }
    int curC = second[i] - 'a';
    cur_hash = mult(cur_hash, p);
    cur_hash = (1LL * cur_hash + 1LL * curC) % base;
    window.push_front(curC);
    if (i < n * k) {
      int pos = i % k;
      int real_pos = i % (n * k);
      if (bd.count(make_pair(cur_hash, pos))) continue;
      if (sot.count(make_pair(cur_hash, pos))) {
        sot.erase(make_pair(cur_hash, pos));
        bd.insert(make_pair(cur_hash, pos));
      } else {
        sot[make_pair(cur_hash, pos)] = real_pos;
      }
    }
  }
  int g;
  read(g);
  for (int i = 0; i < g; i++) {
    string t;
    reads(t);
    cur_hash = 0;
    for (int j = 0; j < k; j++) {
      int curC = t[j] - 'a';
      cur_hash = (1LL * cur_hash + mult(d[j], curC)) % base;
    }
    for (int pos = 0; pos < k; pos++) {
      if (sot.count(make_pair(cur_hash, pos))) {
        int real_pos = sot[make_pair(cur_hash, pos)];
        mda[real_pos] = i + 1;
      }
    }
  }
  for (int i = 0; i < k; i++) good[i] = 1;
  for (int i = 0; i < n * k; i++) {
    if (mda[i] == 0) good[i % k] = 0;
  }
  for (int i = 0; i < k; i++) {
    if (good[i]) {
      puts("YES");
      for (int j = i; j < n * k; j += k) {
        printf("%d ", mda[j]);
      }
      exit(0);
    }
  }
  puts("NO");
  return 0;
}
