#include<fstream>
#include<iostream>
using namespace std;
char a[2000002],b[2000002];
int pi[2000002],pos[1002];
int m,n;



void prefix()
{int i,q=0;
 for(i=2,pi[1]=0;i<=m;++i)
 {
  while (q && a[q+1] != a[i])
	 q = pi[q];
   if (a[q+1] == a[i])
	  ++q;
   pi[i] = q;
 }

}


int main()
{int i,q=0,ni=0;
 for(i=0;i<1002;i++)pos[i]=-1;
 ifstream in("strmatch.in");
 ofstream out("strmatch.out");
 in>>a>>b;
   for (; (a[m] >= 'A' && a[m] <= 'Z') || (a[m] >= 'a' && a[m] <= 'z')
            || (a[m] >= '0' && a[m] <= '9'); ++m);
   for (; (b[n] >= 'A' && b[n] <= 'Z') || (b[n] >= 'a' && b[n] <= 'z')
            || (b[n] >= '0' && b[n] <= '9'); ++n);
   for (i = m; i; --i) a[i] = a[i-1]; a[0] = ' '; 
   for (i = n; i; --i) b[i] = b[i-1]; b[0] = ' ';  
  prefix();

   for (i = 1; i <= n; ++i)
   {
        while (q && a[q+1] != b[i])
            q = pi[q];
        if (a[q+1] == b[i])
            ++q;
       if (q == m)
        {
            q = pi[m];
            ++ni;
            if (ni <= 1000)
                pos[ni] = i-m;  
        }  
    }      
 out<<ni<<'\n';
 if(ni>1000)n=1000;
 for(i=1;i<=ni;++i)
		if(pos[i]!=-1) out<<pos[i]<<' ';
 out<<'\n';	
 return 0;
}