#include <bits/stdc++.h>
using namespace std;
static const int maxn = 1000 + 10;
int n, m, f[maxn][maxn];
char s[maxn], t[maxn];
int main() {
  scanf("%d %d", &n, &m);
  scanf("%s", s);
  scanf("%s", t);
  int mn = n + 1;
  vector<int> ans;
  for (int i = 0; i + n <= m; i++) {
    int count = 0;
    vector<int> now;
    for (int j = 0; j < n; j++)
      if (s[j] != t[i + j]) {
        count++;
        now.emplace_back(j + 1);
      }
    if (count < mn) {
      mn = count;
      ans = now;
    }
  }
  printf("%d\n", mn);
  for (int i = 0; i < ans.size(); i++)
    printf("%d%c", ans[i], " \n"[i == mn - 1]);
  return 0;
}
