Codeforces822 B. Crossword solving

B. Crossword solving

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 strings="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 tcorrespondingly.

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 

————————————————————————————————

题目的意思是给出两个字符串，可以把第一个字符串任意位置变成任意的字母使他成为

另一个的子串，求最少变的数量和位置

思路：n^2暴力匹配

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>
using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;
char a[1005],b[1005];

int main()
{
    int n,m;
    scanf("%d%d",&m,&n);
    scanf("%s",a);
    scanf("%s",b);
    int mn=INF;
    vector<int>x;
    vector<int>ans;

    for(int i=0; i<=n-m; i++)
    {
        x.clear();
        for(int j=0;j<m;j++)
        {
            if(b[i+j]!=a[j])
                x.push_back(j+1);
        }
        if(mn>x.size())
        {
            ans.clear();
            mn=x.size();
            for(int i=0;i<mn;i++)
                ans.push_back(x[i]);
        }
    }
    printf("%d\n",mn);

    int q=0;
    for(int i=0;i<mn;i++)
    {
        if(q++)
            printf(" ");
        printf("%d",ans[i]);
    }
    printf("\n");
        return 0;
}