#include <bits/stdc++.h>
#define ll long long
using namespace std;
char s1[1000005],s2[1000005];
int nxt[1000005],l1,l2;
int getnxt(char p[]){
	int j=0,k=-1,pl=strlen(p);
	nxt[0]=-1;
	while(j<pl){
		if(k==-1||p[j]==p[k])
			nxt[++j]=++k;
		else k=nxt[k];
	}
}
int kmp(char p[],char s[]){
	int i=0,j=0,sl=strlen(s);
	getnxt(s);
	while(p[i]){
		if(j==-1||p[i]==s[j]) i++,j++;
		else j=nxt[j];
		if(j==sl) cout<<i-sl+1<<endl;
	}
} 
int main(){
//	freopen("count.in","r",stdin);
//	freopen("count.out","w",stdout);
	cin>>s1>>s2;
	l1=strlen(s1);l2=strlen(s2);
	kmp(s1,s2);
	for(int i=1;i<=l2;i++) printf("%d ",nxt[i]);
	return 0;
}