#include<fstream>
#include<cstdio>
#include<set>
#include<stack>
#define FIT(a,b) for(vector<int>::iterator it=b.begin();it!=b.end();it++)
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define deb printf("OK!\n");
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define N 2000100
#define mod 666013
#define se second
#define ll long long
#define infile "strmatch.in"
#define outfile "strmatch.out"
using namespace std;
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
ifstream f(infile);
ofstream g(outfile);
int sol[1010];
char s1[N],s2[N];
int z[N],n,m,L,R,lcp,t;
int main ()
{
	f>>(s1+1);
	f>>(s2+1);
	L=R=1;
	n=strlen(s1+1);
	m=strlen(s2+1);
	FOR(i,2,n)
	{
		if(R>=i)
			z[i]=min(z[i-L+1],R-i+1); //aici e tot shmenul
		for(;i+z[i]<=n&&s1[z[i]+1]==s1[i+z[i]];++z[i]);
		if(i+z[i]-1>R)
		{
			L=i;
			R=i+z[i]-1;
		}
	}
	L=R=0;
	lcp=0;
	FOR(i,1,m)
	{
		if(R>=i)
			lcp=min(z[i-L+1],R-i+1); //dupa cum se vede, shmenul e folosit si aici
		for(;i+lcp<=m&&lcp<n&&s2[i+lcp]==s1[lcp+1];++lcp);
		if(lcp+i-1>R)
		{
			L=i;
			R=i+lcp-1;
		}
		if(lcp==n)
		{
			++t;
			if(t<=1000)
				sol[t]=i-1;
		}
	}
	g<<t<<"\n";
	FOR(i,1,min(t,1000))
	g<<sol[i]<<" ";
	return 0;
}