//mod!
//N=inf!
//long long!
#include<bits/stdc++.h>

using namespace std;

const int N=2e6+5;
const long long mod1=1e9+7,mod2=1e9+9;

long long n,mi1[N],mi2[N],has1[N],has2[N],ans[N];
long long num[N];
vector<int> f[N]; 
string s,t;

pair<int,int> ask(int l,int r){
	if(l>r) return {0,0};
	int len=r-l+1;
	return{(has1[r]-has1[l-1]*mi1[len]%mod1+mod1)%mod1,(has2[r]-has2[l-1]*mi2[len]%mod2+mod2)%mod2};
}

pair<int,int> ask1(int l,int r,int p){
	if(l>r) return {0,0};
	int len=r-l+1;
	if(l>p||r<p){
		return{(has1[r]-has1[l-1]*mi1[len]%mod1+mod1)%mod1,(has2[r]-has2[l-1]*mi2[len]%mod2+mod2)%mod2};
	}
	else{
		return{(has1[r]-has1[l-1]*mi1[len]%mod1+(t[p]-s[p])*mi1[r-p]%mod1+2*mod1)%mod1,(has2[r]-has2[l-1]*mi2[len]%mod2+(t[p]-s[p])*mi2[r-p]%mod2+mod2)%mod2};
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>s>>t;
	n=s.size();
	s=" "+s; 
	t=" "+t;
	mi1[0]=mi2[0]=1;
	for(int i=1;i<=n;i++) mi1[i]=mi1[i-1]*131%mod1,mi2[i]=mi2[i-1]*131%mod2;
	for(int i=1;i<=n;i++) has1[i]=has1[i-1]*131+s[i],has2[i]=has2[i-1]*131+s[i],has1[i]%=mod1,has2[i]%=mod2;
	for(int i=1;i<=n;i++) num[i]=max(num[i-1],0ll+i*(ask(1,i)==ask(n-i+1,n)));
//	for(int i=1;i<=n;i++) cout<<num[i]<<" ";
//	cout<<"\n";
	for(int i=2;i<=n;i++){
		if(ask(1,n-i+1)==ask(i,n)) continue;
		int lp=0,rp=n-i+1,res,mid;
		while(lp<=rp){
			mid=lp+rp>>1;
			if(ask(1,mid)==ask(i,i+mid-1)) lp=mid+1,res=mid;
			else rp=mid-1; 
		}
//		cout<<i<<" "<<res<<"\n";
		int p=res+1,q=i+res;
		if(ask1(1,n-i+1,p)==ask1(i,n,p)) ans[p]=max(ans[p],n-i+1);
		if(ask1(1,n-i+1,q)==ask1(i,n,q)) ans[q]=max(ans[q],n-i+1);
	}
	for(int i=1;i<=n;i++){
		if(t[i]==s[i]) ans[i]=num[n]; 
		else ans[i]=max(ans[i],num[min(i-1ll,n-i)]);//和t无相交 
	}
	for(int i=1;i<=n;i++) cout<<ans[i]<<"\n";
}