#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int N = 2e6;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long i, j, k;
  long long n, m, min;
  string s, t;
  cin >> n >> m;
  cin >> s >> t;
  min = 100000000000;
  vector<long long> v;
  vector<long long> temp;
  for (i = 0; i <= m - n; i++) {
    for (j = 0; j < n; j++) {
      if (s[j] != t[i + j]) {
        temp.push_back(j + 1);
      }
    }
    if (min > temp.size()) {
      min = temp.size();
      v = temp;
    }
    temp.clear();
  }
  cout << v.size() << "\n";
  for (i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
