#include <bits/stdc++.h>
using namespace std;
const int Inf = 0x3F3F3F3F;
const int negInf = 0xC0C0C0C0;
const long long mod = 1e9 + 7;
int main() {
  int na, nb;
  cin >> na >> nb;
  string s, t;
  cin >> s >> t;
  vector<int> ans;
  int best = Inf;
  for (int start = 0; start <= nb - na; ++start) {
    int cur = 0;
    vector<int> pos;
    for (int i = 0; i < na; ++i) {
      if (s[i] != t[i + start]) {
        cur++;
        pos.push_back(i + 1);
      }
    }
    if (cur < best) {
      best = cur;
      ans = pos;
    }
  }
  cout << best << endl;
  for (auto& p : ans) cout << p << " ";
  cout << endl;
  return 0;
}
