#include<bits/stdc++.h>
using namespace std;
const int N=100005,M=100005;
char s[M],p[N];
int n,m,ne[M];
int main()
{
	cin>>s+1>>p+1;
	n=strlen(p+1),m=strlen(s+1);
	for(int i=2,j=0;i<=n;i++)
	{
		while(j and p[i]!=p[j+1])j=ne[j];
		if(p[i]==p[j+1])j++;
		ne[i]=j;
	}
	for(int i=1,j=0;i<=m;i++)
	{
		while(j and s[i]!=p[j+1])j=ne[j];
		if(s[i]==p[j+1])j++;
		if(j==n)
		{
			cout<<i-n+1<<endl;
			j=ne[j];
		}
	}
	cout<<endl;
	for(int i=1;i<=n;i++)cout<<ne[i]<<" ";
}