#include<bits/stdc++.h>
#define file(x) freopen(#x ".in","r",stdin),freopen(#x ".out","w",stdout)
#define ll long long
#define ull unsigned long long
#define INF 0x7fffffff
#define INF64 1e18
using namespace std;

constexpr int N=2e6+5;

string s,t;

int n;

struct Hsh{
	ull bas[N],hsh[N];
	void init(string &s){
		bas[0]=1;hsh[0]=0;
		for(int i=1;i<=n;i++)
			bas[i]=bas[i-1]*55,hsh[i]=hsh[i-1]*55+s[i-1];
	}
	ull query(int l,int r){
		return hsh[r]-hsh[l-1]*bas[r-l+1];
	}
	ull get(int l,int r,int pos,int c){
		ull res=query(l,r);
		if(l<=pos&&pos<=r){
			res-=s[pos-1]*bas[r-pos],
			res+=t[pos-1]*bas[r-pos];
		}
		return res;
	}
}s1;

int z[N],res[N],tmp[N];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>s>>t;
	n=s.length();
	s1.init(s);
	z[1]=0;int zl=0,zr=0;
	for(int i=2;i<=n;i++){
		if(i<=zr) z[i]=min(zr-i+1,z[i-zl+1]);
		while(i+z[i]<=n&&s[i+z[i]-1]==s[z[i]]) z[i]++;
		if(i+z[i]>zr) zl=i,zr=i+z[i]-1;
	}
	int bd=0;
	for(int i=2;i<=n;i++){
		int len=n-i+1;
		if(z[i]==len) {
			bd=max(bd,len);
			if(len*2<n) tmp[len]=len;
		}
		if(s1.get(1,len,z[i]+1,t[z[i]])==s1.get(i,n,z[i]+1,t[z[i]]))
			res[z[i]+1]=max(res[z[i]+1],len);
		if(s1.get(1,len,i+z[i],t[i+z[i]-1])==s1.get(i,n,i+z[i],t[i+z[i]-1]))
			res[i+z[i]]=max(res[i+z[i]],len);
	}
	for(int i=1;i<=n;i++) tmp[i]=max(tmp[i],tmp[i-1]);
	for(int i=1;i<=n;i++){
		if(s[i-1]==t[i-1]) res[i]=max(res[i],bd);
		res[i]=max(res[i],tmp[min(i-1,n-i)]);
	}
	for(int i=1;i<=n;i++) cout<<res[i]<<'\n';
}