using namespace std;
#include <cstdio>
#define MAX 2000010
#define nrLitere (26+26+10)
#define nrPrim 100021
char s[MAX], p[MAX];
int ns,np;
FILE * fin= fopen("strmatch.in","r");
FILE * fout=fopen("strmatch.out","w");

void read();
void solve();
void write();
int ord(char c);
int main(){
		read();
		solve();
		write();
		return 0;
	}

int isOk(char c){
	if(c>='A' && c<='Z')
		return 1;
	if(c>='a' && c<='z')
		return 1;
	if(c>='0' && c<='9')
		return 1;
	return 0;
}

void read(){
	ns=np=0;
	fscanf(fin,"%s%s",p,s);
	for( ; s[ns] ; ++ns);
	for( ; p[np] ; ++np);
}

int nrpoz, nrpp, poz[1010];

void solve(){
	int dlam_1=1; //(d=nrLitere)^(np-1)
	for(int i=1;i<np;++i)
		dlam_1 =(dlam_1 *nrLitere) % nrPrim;
	int hp=0 ; //hashul lui p
	for(int i=0;i<np;i++)
		hp = (hp * nrLitere + ord(p[i])) % nrPrim;
	//printf("hp = %d\n",hp);
	int hs = 0; // hashul lui s1s2...snp, se modifica mai tarziu
	for(int i=0;i<np;i++)
		hs = (hs * nrLitere + ord(s[i])) % nrPrim;
	for(int i=0;i<ns-np+1;++i){
		//printf("%d %d %d\n",i,s[i],hs);
		//verific protrivirea
		if(hp ==hs && s[i+np-1]==p[np-1] && s[i]==p[0]){
			nrpoz++;
			if(nrpoz<=1000)
				poz[++nrpp]=i;
		}
		hs = (hs + nrPrim-(ord(s[i])*dlam_1)%nrPrim)%nrPrim;
		hs = (hs*nrLitere+ord(s[i+np])) % nrPrim;
	}
}

void write(){
	fprintf(fout,"%d\n",nrpoz);
	for(int i=1;i<=nrpp;++i)
		fprintf(fout,"%d ",poz[i]);
}

int ord(char c){
	if(c<='9')
		return c-'0';
	if(c<='Z')
		return 10+c-'A';
	return 10+26+c-'a';
}