Erelong Leha was bored by calculating of the greatest common divisor of two factorials. Therefore he decided to solve some crosswords. It's well known that it is a very interesting occupation though it can be very difficult from time to time. In the course of solving one of the crosswords, Leha had to solve a simple task. You are able to do it too, aren't you?

Leha has two strings s and t. The hacker wants to change the string s at such way, that it can be found in t as a substring. All the changes should be the following: Leha chooses one position in the string s and replaces the symbol in this position with the question mark "?". The hacker is sure that the question mark in comparison can play the role of an arbitrary symbol. For example, if he gets string s="ab?b" as a result, it will appear in t="aabrbb" as a substring.

Guaranteed that the length of the string s doesn't exceed the length of the string t. Help the hacker to replace in s as few symbols as possible so that the result of the replacements can be found in t as a substring. The symbol "?" should be considered equal to any other symbol.

Input

The first line contains two integers n and m (1 ≤ n ≤ m ≤ 1000) — the length of the string s and the length of the string t correspondingly.

The second line contains n lowercase English letters — string s.

The third line contains m lowercase English letters — string t.

Output

In the first line print single integer k — the minimal number of symbols that need to be replaced.

In the second line print k distinct integers denoting the positions of symbols in the string s which need to be replaced. Print the positions in any order. If there are several solutions print any of them. The numbering of the positions begins from one.

Examples

Input

3 5
abc
xaybz


Output

2
2 3 


Input

4 10
abcd
ebceabazcd


Output

1
2 
import java.io.*;
import java.util.*;

public class CF {
//    public static final double EPS = 1e-6;

    private static final FastIO io = new FastIO();

    private static long[] sum;

    private static long sum(int l, int r) {
        return sum[r] - sum[l];
    }

    private static void solve(int n, long[] arr) {
        sum = new long[n + 1];
        sum[0] = 0L;

        int[] maxSumIndexes = new int[n + 1];
        maxSumIndexes[0] = 0;

        long maxSum = arr[0];
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i - 1] + arr[i - 1];
            if (sum[i] > maxSum) {
                maxSum = sum[i];
                maxSumIndexes[i] = i;
            } else {
                maxSumIndexes[i] = maxSumIndexes[i - 1];
            }
        }

        int[] maxReSumIndexes = new int[n + 1];
        maxReSumIndexes[0] = 0;

        long minSum = arr[n - 1];
        long acc = 0L;
        for (int i = 1; i <= n; i++) {
            acc += arr[n - i];
            if (acc < minSum) {
                minSum = acc;
                maxReSumIndexes[i] = i;
            } else {
                maxReSumIndexes[i] = maxReSumIndexes[i - 1];
            }
        }

        long maxVal = Long.MIN_VALUE;
        int ans0 = 0;
        int ans1 = 0;
        int ans2 = 0;
        for (int delim1 = 0; delim1 <= n; delim1++) {
            int delim0 = maxSumIndexes[delim1];
            int delim2 = n - maxReSumIndexes[n - delim1];
            long val = sum(0, delim0) - sum(delim0, delim1) + sum(delim1, delim2) - sum(delim2, n);
            if (val > maxVal) {
                maxVal = val;
                ans0 = delim0;
                ans1 = delim1;
                ans2 = delim2;
            }
        }
        io.println(ans0 + " " + ans1 + " " + ans2);
    }

    public static void main(String[] args) {
        int n = io.nextInt();
        int m = io.nextInt();
        String sub = io.next();
        String text = io.next();
        int minDiff = Integer.MAX_VALUE;
        int pos = -1;
        for (int i = 0; i <= m - n; i++) {
            int cnt = 0;
            for (int j = 0; j < n; j++) {
                if (sub.charAt(j) != text.charAt(i + j)) {
                    ++cnt;
                }
            }
            if (cnt < minDiff) {
                minDiff = cnt;
                pos = i;
            }
        }

        io.println(minDiff);
        for (int j = 0; j < n; j++) {
            if (sub.charAt(j) != text.charAt(pos + j)) {
                io.print((j + 1) + " ");
            }
        }

        io.flush();
        io.close();
    }

//    public static final class Point {
//        long x;
//        long y;
//
//        public Point(long x, long y) {
//            this.x = x;
//            this.y = y;
//        }
//
//        public long distance2(Point point) {
//            long dx = x - point.x;
//            long dy = y - point.y;
//            return dx * dx + dy * dy;
//        }
//
//        public Point add(Point point) {
//            return new Point(x + point.x, y + point.y);
//        }
//
//        public Point subtract(Point point) {
//            return new Point(x - point.x, y - point.y);
//        }
//
//        public long magnitude2() {
//            return x * x + y * y;
//        }
//
//        public double magnitude() {
//            return Math.hypot(x, y);
//        }
//
//        public long dotProduct(Point point) {
//            return x * point.x + y * point.y;
//        }
//
//        public long crossProduct(Point point) {
//            return point.x * y - point.y * x;
//        }
//
//        public boolean equals(Point anotherPoint) {
//            return x == anotherPoint.x && y == anotherPoint.y;
//        }
//    }

    public static final class FastIO extends PrintWriter {
        private BufferedReader bufferedReader;
        private StringTokenizer stringTokenizer;

        public FastIO() {
            this(System.in, System.out);
        }

        public FastIO(InputStream inputStream, OutputStream outputStream) {
            super(new BufferedOutputStream(outputStream));
            bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
            stringTokenizer = new StringTokenizer("");
        }

        public String next() {
            while (!stringTokenizer.hasMoreTokens()) {
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return stringTokenizer.nextToken();
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public int[] nextInts(int n) {
            int[] ints = new int[n];
            for (int i = 0; i < n; i++) {
                ints[i] = nextInt();
            }
            return ints;
        }

        public long[] nextLongs(int n) {
            long[] longs = new long[n];
            for (int i = 0; i < n; i++) {
                longs[i] = nextLong();
            }
            return longs;
        }
    }
}
