#include <bits/stdc++.h>
using namespace std;
int r = 1001, u = 0;
vector<int> v;
vector<int> v1;
void find(int x, string s, string t, int n) {
  for (int i = 0; i < n; ++i) {
    if (s[i] != t[x]) {
      u++;
      v.push_back(i + 1);
    }
    x++;
  }
  if (u < r) {
    r = u;
    v1 = v;
  }
  v.clear();
  u = 0;
}
int main() {
  int n, m;
  cin >> n >> m;
  string s, t;
  cin >> s >> t;
  for (int i = 0; i <= m - n; ++i) find(i, s, t, n);
  cout << r << endl;
  for (int i = 0; i < v1.size(); ++i) {
    cout << v1.at(i) << " ";
  }
  return 0;
}
