#include <bits/stdc++.h>
const int N = 1e3 + 100;
using namespace std;
int n, m;
char a[N], b[N];
int solve[N];
int ans = 0x3f3f3f3f;
int main() {
  scanf("%d%d", &n, &m);
  scanf("%s", a);
  scanf("%s", b);
  for (int i = 0; i <= m - n; ++i) {
    int as = 0;
    for (int j = 0; j < n; ++j)
      if (b[i + j] != a[j]) ++as;
    if (as < ans) {
      ans = as;
      int ti = 0;
      for (int j = 0; j < n; ++j)
        if (b[i + j] != a[j]) solve[++ti] = j + 1;
    }
  }
  printf("%d\n", ans);
  for (int i = 1; i <= ans; ++i) printf("%d ", solve[i]);
}
