#include <bits/stdc++.h>
using namespace std;
char s[1001];
char t[1001];
int stack[1001];
int top;
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  scanf("%s%s", s, t);
  int i, j;
  int mx = -1;
  vector<int> *v = new vector<int>;
  for (i = 0; i <= m - n; ++i) {
    int c = 0;
    vector<int> *temp = new vector<int>;
    for (j = 0; j < n; ++j) {
      if (t[i + j] == s[j]) {
        c++;
      } else {
        temp->push_back(j + 1);
      }
    }
    if (mx < c) {
      mx = c;
      delete v;
      v = temp;
    }
  }
  int sz = (int)v->size();
  printf("%d\n", sz);
  for (i = 0; i < sz; ++i) {
    printf("%d ", (*v)[i]);
  }
  puts("");
  return 0;
}
