#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265359;
const double EPS = 1e-6;
const int INF = (1e9);
const long long P = 1e9 + 7;
const long long MAX = 200000 + 5;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  string s, t;
  cin >> s;
  cin >> t;
  int best = s.length();
  for (int i = 0; i + s.length() <= t.length(); i++) {
    int ct = 0;
    for (int j = 0; j < s.length(); j++) {
      if (t[i + j] != s[j]) ct++;
    }
    best = min(best, ct);
  }
  vector<int> res;
  for (int i = 0; i + s.length() <= t.length(); i++) {
    int ct = 0;
    for (int j = 0; j < s.length(); j++) {
      if (t[i + j] != s[j]) ct++;
    }
    if (ct == best) {
      for (int j = 0; j < s.length(); j++) {
        if (t[i + j] != s[j]) res.push_back(j + 1);
      }
      break;
    }
  }
  cout << res.size() << endl;
  for (int i = 0; i < res.size(); ++i) {
    cout << res[i] << " ";
  }
  return 0;
}
