#include <bits/stdc++.h>

using namespace std;

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

const int mod1 = 1e9 + 9;
const int mod2 = 666013;

const int kN = 2e6 + 5;

int cnt;
long long h1[kN], h2[kN], hS1, hS2;
char s[kN], t[kN];
bitset<kN>used;
vector<int>ans;

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

   fin >> s >> t;

   int S = (int)strlen(s);
   int T = (int)strlen(t);

   long long p1 = 1, p2 = 1;
   for (int i = 0; i < S; i++){
      hS1 = (hS1 + (s[i] - 'A' + 1) * p1) % mod1;
      hS2 = (hS2 + (s[i] - 'A' + 1) * p2) % mod2;
      p1 = (p1 * 76) % mod1;
      p2 = (p2 * 76) % mod2;
   }

   p1 = p2 = 1;
   for (int i = 0; i < T; i++){
      h1[i + 1] = (h1[i] + (t[i] - 'A' + 1) * p1) % mod1;
      h2[i + 1] = (h2[i] + (t[i] - 'A' + 1) * p2) % mod2;
      p1 = (p1 * 76) % mod1;
      p2 = (p2 * 76) % mod2;
   }

   p1 = p2 = 1;
   for (int i = 0; i + S - 1 < T; i++){
      long long cur_h1 = (h1[i + S] - h1[i] + mod1) % mod1;
      long long cur_h2 = (h2[i + S] - h2[i] + mod2) % mod2;
      if (cur_h1 == (hS1 * p1) % mod1 && cur_h2 == (hS2 * p2) % mod2){
         ans.push_back(i);
      }
      p1 = (p1 * 76) % mod1;
      p2 = (p2 * 76) % mod2;
   }

   fout << (int)ans.size() << '\n';
   for (int i = 0; i < min(1000, (int)ans.size()); i++){
      fout << ans[i] << " ";
   }
}