#include <bits/stdc++.h>
using namespace std;
int main() {
  int la, lb, i, j, Min = 2100000000, sum = 0;
  char a[1005], b[1005];
  queue<int> ans1, ans2;
  scanf("%d %d", &la, &lb);
  scanf("%s %s", a, b);
  for (int i = 0; i <= lb - la; i++) {
    sum = 0;
    while (!ans2.empty()) ans2.pop();
    for (int j = 0; j < la; j++) {
      if (a[j] != b[i + j]) {
        sum++;
        ans2.push(1 + j);
      }
    }
    if (sum < Min) {
      Min = sum;
      while (!ans1.empty()) ans1.pop();
      for (int j = 1; j <= Min; j++) {
        ans1.push(ans2.front());
        ans2.pop();
      }
    }
  }
  printf("%d\n", Min);
  for (int i = 1; i <= Min; i++) {
    printf("%d", ans1.front());
    ans1.pop();
    if (i != Min) printf(" ");
  }
  return 0;
}
