Problem: Several years ago Tolya had n computer games and at some point of time he decided to burn them to CD. After that he wrote down the names of the games one after another in a circle on the CD in clockwise order. The names were distinct, the length of each name was equal to k. The names didn't overlap.

Thus, there is a cyclic string of length n·k written on the CD.

Several years have passed and now Tolya can't remember which games he burned to his CD. He knows that there were g popular games that days. All of the games he burned were among these g games, and no game was burned more than once.

You have to restore any valid list of games Tolya could burn to the CD several years ago.

Input

The first line of the input contains two positive integers n and k (1 ≤ n ≤ 105, 1 ≤ k ≤ 105) — the amount of games Tolya burned to the CD, and the length of each of the names.

The second line of the input contains one string consisting of lowercase English letters — the string Tolya wrote on the CD, split in arbitrary place. The length of the string is n·k. It is guaranteed that the length is not greater than 106.

The third line of the input contains one positive integer g (n ≤ g ≤ 105) — the amount of popular games that could be written on the CD. It is guaranteed that the total length of names of all popular games is not greater than 2·106.

Each of the next g lines contains a single string — the name of some popular game. Each name consists of lowercase English letters and has length k. It is guaranteed that the names are distinct.

Output

If there is no answer, print "NO" (without quotes).

Otherwise, print two lines. In the first line print "YES" (without quotes). In the second line, print n integers — the games which names were written on the CD. You should print games in the order they could have been written on the CD, it means, in clockwise order. You can print games starting from any position. Remember, that no game was burned to the CD more than once. If there are several possible answers, print any of them.

Examples

Input

3 1
abc
4
b
a
c
d


Output

YES
2 1 3 


Input

4 2
aabbccdd
4
dd
ab
bc
cd


Output

NO

Solution (in JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        EGamesOnACD solver = new EGamesOnACD();
        solver.solve(1, in, out);
        out.close();
    }

    static class EGamesOnACD {
        long p = 31;
        long mod = (long) (1e9 + 7);
        long p1 = 53 * 17;

        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int t = 1;
            //  t= sc.nextInt();
            while (t-- > 0) {
                int num = sc.nextInt();
                int k = sc.nextInt();
                String s = sc.nextLine();
                char[] arr = (s + s).toCharArray();
                int n = s.length();
                long[] pow = new long[n + k];
                long po = 1;
                for (int i = 0; i < n + k; i++) {
                    pow[i] = po;
                    po *= p;
                    po %= mod;
                }
                long[] pow1 = new long[n + k];
                long po1 = 1;
                for (int i = 0; i < n + k; i++) {
                    pow1[i] = po1;
                    po1 *= p1;
//				po1%=mod1;
                }
                long[] hash = new long[n + k];
                long now = 0;
                for (int i = 0; i < n + k; i++) {
                    now *= p;
                    now %= mod;
                    now += (arr[i] - 'a' + 1);
                    if (now > mod) now -= mod;
                    hash[i] = now;
                }
                long[] hash1 = new long[n + k];
                now = 0;
                for (int i = 0; i < n + k; i++) {
                    now *= p1;
//				now%=mod1;
                    now += (arr[i] - 'a' + 1);
//				if(now>mod1)now-=mod1;
                    hash1[i] = now;
                }
                int q = sc.nextInt();
                long[] need = new long[q];
                HashMap<Long, Integer> hm = new HashMap<>();
                long[] need1 = new long[q];
                HashMap<Long, Integer> hm1 = new HashMap<>();
                for (int i = 0; i < q; i++) {
                    now = 0;
                    char[] tmp = sc.nextLine().toCharArray();
                    for (int j = 0; j < k; j++) {
                        now *= p;
                        now %= mod;
                        now += (tmp[j] - 'a' + 1);
                        if (now > mod) now -= mod;
                    }
                    need[i] = now;
                    hm.put(need[i], i + 1);
                    now = 0;
                    for (int j = 0; j < k; j++) {
                        now *= p1;
//				now%=mod1;
                        now += (tmp[j] - 'a' + 1);
//				if(now>mod1)now-=mod1;
                    }
                    need1[i] = now;
                    hm1.put(need1[i], i + 1);
                }

                for (int i = 0; i < k; i++) {
                    TreeSet<Integer> ts = new TreeSet<>();
                    TreeSet<Integer> ts1 = new TreeSet<>();

                    int[] ans = new int[num];
                    int id = 0;
                    for (int j = i; j < n; j += k) {
                        long res = hash[j + k - 1];
                        if (j > 0) res = (res - (hash[j - 1] * pow[k]) % mod + mod) % mod;
//        		pw.println(res);
                        if (hm.containsKey(res)) {
                            ts.add(hm.get(res));
                            ans[id++] = hm.get(res);
                        }
                    }
                    int[] ans1 = new int[num];
                    id = 0;
                    for (int j = i; j < n; j += k) {
                        long res = hash1[j + k - 1];
                        if (j > 0) res = (res - (hash1[j - 1] * pow1[k]));
//        		pw.println(res);
                        if (hm1.containsKey(res)) {
                            ts1.add(hm1.get(res));
                            ans1[id++] = hm1.get(res);
                        }
                    }
                    if (ts.size() == num) {
                        pw.println("YES");
                        for (int x : ans) pw.print(x + " ");
                        return;
                    }
                    if (ts1.size() == num) {
                        pw.println("YES");
                        for (int x : ans1) pw.print(x + " ");
                        return;
                    }
                }
                pw.println("NO");
            }
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String nextLine() {
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }

    }
}