#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 5;
const int inf = 1e9 + 7;
vector<int> x;
vector<int> Q;
int main() {
  int n, m;
  char a[maxn], b[maxn];
  scanf("%d%d%s%s", &n, &m, a, b);
  int ans = inf;
  int cnt;
  for (int i = 0; i <= m - n; i++) {
    cnt = 0;
    x.clear();
    for (int j = 0; j < n; j++)
      if (b[i + j] != a[j]) {
        cnt++;
        x.push_back(j + 1);
      }
    if (cnt < ans) {
      Q.clear();
      for (int k = 0; k < cnt; k++) Q.push_back(x[k]);
      x.clear();
      ans = cnt;
    }
  }
  printf("%d\n", ans);
  for (int i = 0; i < ans; i++) {
    printf("%d", Q[i]);
    if (i != ans - 1)
      printf(" ");
    else
      printf("\n");
  }
  return 0;
}
