#include <bits/stdc++.h>
using namespace std;
int main() {
  string s, t;
  int m, n, minn = 10000, i, j, k, loc;
  cin >> n >> m;
  cin >> s >> t;
  vector<int> locations[m - n + 1];
  ;
  for (i = 0; i < m - n + 1; ++i) {
    k = 0;
    for (j = 0; j < n; ++j) {
      if (t[i + k] != s[j]) {
        locations[i].push_back(j + 1);
      }
      ++k;
    }
    if (locations[i].size() < minn) {
      minn = locations[i].size();
      loc = i;
    }
  }
  cout << minn << endl;
  for (i = 0; i < locations[loc].size(); ++i) {
    if (i > 0) cout << " ";
    cout << locations[loc][i];
  }
  return 0;
}
