#include<cstring>
#include<fstream>
#include<vector>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char s1[2000005],s2[2000005];
int sar[2000005],n1,n2,nr;
vector<int> sol;
int minim(int a,int b){if(a<b)return b;else return a;}
void completeaza()
{
	for(int i=2;i<=n1;i++)
		if(s1[i-1]==s1[sar[i-1]])
			sar[i]=sar[i-1]+1;		
}
void kmp()
{
	int i,j,k=0,nrap=0;
	for(i=0;i<n2;)
	{
		j=0;k=i;
		while(j<n1&&k<n2&&s2[k]==s1[j]){k++;j++;}
		if(j==n1){nr++;sol.push_back(i);}		
		i=k-sar[j];			
	}
	g<<nr<<'\n';
	nrap=minim(nr,1000);
	for(i=0;i<nrap;i++)
		g<<sol[i]<<" ";
	
}
int main()
{

	sar[0]=-1;sar[1]=0;
	f.getline(s1,2000005);
	f.getline(s2,2000005);
	n1=strlen(s1);
	n2=strlen(s2);
	completeaza();
	kmp();
	return 0;
}