#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const int inf = (int)1e8 + 100;
const long long MAXN = 300005;
const long long MAXVAL = 10000000;
const long long INF = (long long)1e17 + 50;
const long long MOD = (long long)1e9 + 7;
const unsigned long long HASH_MOD = 2305843009213693951;
string failMessage;
void fail() {
  cout << failMessage;
  exit(0);
};
void solve() {
  int n, m;
  cin >> n >> m;
  string s, t;
  cin >> s >> t;
  int best = inf;
  vector<int> ans, cur;
  for (int i = 0; i + n - 1 < m; i++) {
    cur.clear();
    for (int j = i; j < i + n; j++)
      if (s[j - i] != t[j]) cur.push_back(j - i);
    if (cur.size() < best) {
      best = cur.size();
      ans = cur;
    }
  }
  cout << ans.size() << endl;
  for (auto e : ans) cout << e + 1 << " ";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(15);
  solve();
  (void)0;
}
