#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 11;
const int MOD = 1e9 + 7;
const long long LLINF = numeric_limits<long long>::max() / 3;
string s, t;
int n, m, sol = INF;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m >> s >> t;
  for (int i = 0; i + n - 1 < m; ++i) {
    int cnt = 0;
    for (int j = 0; j < n; ++j)
      if (s[j] != t[i + j]) ++cnt;
    sol = min(sol, cnt);
  }
  cout << sol << '\n';
  for (int i = 0; i + n - 1 < m; ++i) {
    int cnt = 0;
    for (int j = 0; j < n; ++j)
      if (s[j] != t[i + j]) ++cnt;
    if (cnt == sol) {
      for (int j = 0; j < n; ++j)
        if (s[j] != t[i + j]) cout << j + 1 << ' ';
      break;
    }
  }
  return 0;
}
