Codeforces Round #422 B

#include<bits/stdc++.h>
#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb push_back
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
using namespace std;
const int N=1e5+100;

char a[1005],b[1005];
int anss[1005];
int ans=100005,la,lb;
int main(){
    cin>>la>>lb;
    cin>>a+1>>b+1;
    for(int i=0; i<=lb-la; ++i){
        int k=0;
        for(int j=1; j<=la; ++j){
            if(a[j]!=b[j+i]) k++;
        }
        if(k<ans){
            int l=0;
            for(int j=1; j<=la; ++j){
                if(a[j]!=b[j+i]){
                    anss[++l]=j;
                }
            }
            ans=k;
        }
    }
    cout<<ans<<endl;
    for(int i=1; i<=ans; ++i){
        cout<<anss[i]<<‘ ‘;
    }
    return 0;
}