#include <bits/stdc++.h>
using namespace std;
int n, m;
char a[2000], b[2000];
char c;
int ans = 9999, loc = -1;
int main() {
  cin >> n >> m;
  c = getchar();
  for (int i = 1; i <= n; i++) {
    while (c < 'a' || c > 'z') c = getchar();
    a[i] = c;
    c = getchar();
  }
  for (int i = 1; i <= m; i++) {
    while (c < 'a' || c > 'z') c = getchar();
    b[i] = c;
    c = getchar();
  }
  for (int i = 1; i <= m - n + 1; i++) {
    int sum = 0;
    for (int j = i; j <= i + n - 1; j++) {
      if (a[j - i + 1] != b[j]) sum++;
    }
    if (sum < ans) {
      loc = i;
      ans = sum;
    }
  }
  cout << ans << endl;
  bool flag = true;
  for (int i = loc; i <= loc + n - 1; i++) {
    if (a[i - loc + 1] != b[i]) {
      if (flag)
        flag = false;
      else
        cout << ' ';
      printf("%d", i - loc + 1);
    }
  }
  return 0;
}
