#include <bits/stdc++.h>

using namespace std;

ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");

const int kN = 2e6 + 5;

long long h[kN];
char s[kN], t[kN];
vector<int>v1, v2;
int T, S;

void precalc (int mod, vector<int>&v){
   memset(h, 0, sizeof(h));
   long long p = 1;
   for (int i = 0; i < T; i++){
      h[i + 1] = (h[i] + (t[i] - 'A' + 1) * p) % mod;
      p = (p * 31) % mod;
   }

   p = 1;
   long long hash_s = 0;
   for (int i = 0; i < S; i++){
      hash_s = (hash_s + (s[i] - 'A' + 1) * p) % mod;
      p = (p * 31) % mod;
   }

   p = 1;
   for (int i = 0; i + S - 1 < T; i++){
      long long cur_h = (h[i + S] - h[i] + mod) % mod;
      if (cur_h == (hash_s * p) % mod){
         v.push_back(i);
      }
      p = (p * 31) % mod;
   }
}

int main(){
   ios_base::sync_with_stdio(false);

   fin >> s >> t;
   S = (int)strlen(s);
   T = (int)strlen(t);
   if (S > T){
      fout << "0";
      return 0;
   }
   precalc(1e9 + 9, v1);
   precalc(666013, v2);

   vector<int>ans;
   for (int x : v1){
      if (binary_search(v2.begin(), v2.end(), x)){
         ans.push_back(x);
      }
   }
   fout << (int)ans.size() << '\n';
   for (int i = 0; i < min(1000, (int)ans.size()); i++){
      fout << ans[i] << " ";
   }
}