#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  string s, t;
  cin >> s;
  cin >> t;
  int a[s.length()];
  int d[s.length()];
  int u = 0, max = 0;
  for (int i = 0; i < t.length(); i++) {
    for (int j = i; j < t.length(); j++) {
      u = 0;
      int w = 0;
      if (j - i + 1 == s.length())
        for (int k = i; k <= j; k++) {
          if (s[k - i] == t[k]) {
            u++;
          } else {
            a[w++] = k - i + 1;
          }
        }
      if (max <= u) {
        max = u;
        for (int k = 0; k < s.length() - max; k++) {
          d[k] = a[k];
        }
      }
    }
  }
  cout << s.length() - max << endl;
  for (int k = 0; k < s.length() - max; k++) cout << d[k] << " ";
}
