B - Crossword solving

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 stringssandt. The hacker wants to change the stringsat such way, that it can be found intas a substring. All the changes should be the following: Leha chooses one position in the stringsand 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 strings="ab?b" as a result, it will appear int="aabrbb" as a substring.

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

Input

The first line contains two integersnandm(1 ≤ n ≤ m ≤ 1000) — the length of the stringsand the length of the stringtcorrespondingly.

The second line containsnlowercase English letters — strings.

The third line containsmlowercase English letters — stringt.

Output

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

In the second line printkdistinctintegers denoting the positions of symbols in the stringswhich 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<br />abc<br />xaybz

Output

2<br />2 3

Input

4 10<br />abcd<br />ebceabazcd

Output

1<br />2

1 #include<bits/stdc++.h>
 2 using namespace  std;
 3 
 4 int main() {
 5     int a,b,count;
 6     int ans = 0;
 7     int yy[1005],re[1005];
 8     char str1[1005],str2[1005];
 9     cin>>a>>b;
10     cin>>str1;
11     cin>>str2;
12     queue<int>que;
13     ans = 1009;
14     for(int i = 0; i <= b - a; i++) {
15         count = 0;
16         for(int j = 0; j < a; j++) {
17             if(str1[j] != str2[j+i]) {
18                 yy[count] = j;
19                 count++;
20             }
21         }
22         if(count < ans) {
23             for(int k = 0; k < count; k++) {
24                 re[k] = yy[k];
25             }
26             ans = count;
27         }
28     }
29     cout<<ans<<endl;
30     for(int i = 0; i < ans; i++) {
31         cout<<re[i]+1<<" ";
32     }
33     cout<<endl;
34     return 0;
35 }