program stringmatching;
type buf=array[0..1 shl 17] of char;
     tabel=array[0..2000001] of longint;
     tabee=array[0..1001] of longint;
var s,ss:ansistring; urm:tabel;
    ff1,ff2:buf; sol:tabee;
    i,k,n,m,nr:longint;
    f1,f2:text;
begin
assign (f1,'strmatch.in');
assign (f2,'strmatch.out');
reset (f1);
rewrite (f2);
readln (f1,s);
readln (f1,ss);
k:=0; n:=length(s); m:=length(ss);
for i:=2 to n do begin
while (k>0) and (s[k+1]<>s[i]) do k:=urm[k];
if s[k+1]=s[i] then k:=k+1;
urm[i]:=k;
end;
k:=0;
for i:=1 to m do begin
while (k>0) and (s[k+1]<>ss[i]) do k:=urm[k];
if s[k+1]=ss[i] then k:=k+1;
if k=n then begin
nr:=nr+1; if nr<=1000 then sol[nr]:=i-n+1;
k:=urm[k];
end; end;
writeln (f2,nr);
if nr>1000 then nr:=1000;
for i:=1 to nr do write (f2,sol[i]-1,' ');
close (f1);
close (f2);
end.