#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll MOD=1e9+7;
const ll ex_MOD=998244353;
const ll N=10000009;
ll T,n;
char a[10000000],b[10000000];
ll p[N];
int main(){
	scanf("%s%s",a+1,b+1);
	int i,j=0;
	p[1]=0;
	int n=strlen(a+1),m=strlen(b+1);
	for(int i=1;i<m;i++){
		while(j>0&&b[j+1]!=b[i+1]) j=p[j];
		if(b[i+1]==b[j+1]) j++;
		p[i+1]=j;
	}
	j=0;
	for(int i=0;i<n;i++){
		while(j>0&&b[j+1]!=a[i+1]) j=p[j];
		if(b[j+1]=a[i+1]) ++j;
		if(j==m){
			cout<<i+1-strlen(b+1)+1<<endl;
			j=p[j];
		}
	}
	for(int i=1;i<=m;i++) cout<<p[i]<<" ";
	return 0;
}

wa at sub3 #12 and #13