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