#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#define boo(i) bitset<i>
#define ri register int
#define rll register long long
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define max_(i,j) (i<j?j:i)
#define min_(i,j) (i<j?i:j)
#define abs_(x) (x>0?x:(-x))
using namespace std;
int n;
const int MAXN=3e6+5;
ull has[MAXN],pw[MAXN];
ull geth(int l,int r){
	if(l>r){
		return 0;
	} 
	return has[r]-has[l-1]*pw[r-l+1];
}
int maxn[MAXN];
char a[MAXN],b[MAXN];
bool can[MAXN];
int main(){
	scanf("%s%s",a+1,b+1);
	n=strlen(a+1);
	pw[0]=1ull;
	for(int i=1;i<=n;i++){
		pw[i]=pw[i-1]*131;
		has[i]=has[i-1]*131+a[i];
	}
	for(int i=1;i<=n;i++){
		if(geth(1,i)==geth(n-i+1,n)){
			can[i]=1;
			continue;
		}
		int l=1,r=i-1,mid;
		if(geth(1,1)!=geth(n-i+1,n-i+1)){
			l=0;
		}else{
			
			while(l<r){
				mid=(l+r+1)>>1;
				if(geth(1,mid)==geth(n-i+1,n-i+mid)){
					l=mid;
				}else{
					r=mid-1;
				}
			}	
		}
		ull now1=has[i]+pw[i-l-1]*(b[l+1]-a[l+1]);
		ull now2=geth(n-i+1,n);
		if(l+1>=n-i+1) now2+=pw[n-l-1]*(b[l+1]-a[l+1]);
		if(now1==now2){
			maxn[l+1]=max(maxn[l+1],i);
		}
		now1=geth(1,i);
		if(n-i+l+1<=i)now1+=pw[i-(n-i+l+1)]*(b[n-i+l+1]-a[n-i+l+1]);
		now2=geth(n-i+1,n)+(b[n-i+l+1]-a[n-i+l+1])*pw[i-l-1];
		if(now1==now2){
			maxn[n-i+l+1]=max(maxn[n-i+l+1],i);
		}
	}
	int lst=0;
	for(int i=1;i<=n;i++){
		if(i*2-2<n){
			maxn[i]=max(maxn[i],lst);
			maxn[n-i+1]=max(maxn[n-i+1],lst);
		}
		if(can[i])lst=i;
	}
	for(int i=1;i<=n;i++){
		if(a[i]==b[i]){
			maxn[i]=max(maxn[i],lst);
		}
		printf("%d\n",maxn[i]);
	}
	
}