#include <bits/stdc++.h>
using namespace std;
int fn(char s[], char t[], int x, int y) {
  int j = 0, ans = 0;
  for (j = 0; j < y; j++)
    if (t[x + j] != s[j]) ans++;
  return ans;
}
int main() {
  int n, m, i, ans = 10001, in, k;
  scanf("%d%d", &n, &m);
  char s[1001], t[1001];
  scanf("%s%s", s, t);
  for (i = 0; i < m - n + 1; i++) {
    k = fn(s, t, i, n);
    if (k < ans) {
      ans = k;
      in = i;
    }
  }
  printf("%d\n", ans);
  for (i = 0; i < n; i++) {
    if (s[i] != t[in + i]) printf("%d ", i + 1);
  }
  return 0;
}
