#include <bits/stdc++.h>

using namespace std;

inline int rd()
{
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
	while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

#define x first
#define y second
#define vec vector
#define mp make_pair
#define pb emplace_back
#define upb upper_bound
#define lowb lower_bound
#define isz(x) (int)x.size()
#define gmx(a,b) (a=max(a,b))
#define gmn(a,b) (a=min(a,b))
#define fil(a,x) memset(a,x,sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)

/*

*/

typedef __int128 i128;
typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef set<int>::iterator iter;
const int N=2e6+10;
const ull P=131;

int n;
char a[N],b[N];
ull hs[N],pw[N];

ull ghs(int l,int r) {
	if(l>r) return 0;
	return hs[r]-hs[l-1]*pw[r-l+1];
}
int q1[N],q2[N],f[N];
bool st[N];

bool check(int r,int l,int p) {
	ull x=ghs(1,r),y=ghs(l,n);
	if(p<=r) x-=a[p]*pw[r-p],x+=b[p]*pw[r-p];
	if(p>=l) y-=a[p]*pw[n-p],y+=b[p]*pw[n-p];
	return x==y;
}

signed main()
{
	scanf("%s%s",a+1,b+1),n=strlen(a+1),pw[0]=1;
	rep(i,1,n) pw[i]=pw[i-1]*P,hs[i]=hs[i-1]*P+a[i];
	int ans=0;
	rep(i,1,n-1) { // check border = i;
		if(ghs(1,i)==ghs(n-i+1,n)) {
			ans=i;
			if(i+1<=n-i) q1[i+1]=i,q2[n-i+1]=i;
		} else {
			int l=0,r=i;
			while(l<r) {
				int mid=(l+r+1)>>1;
				if(ghs(1,mid)==ghs(n-i+1,n-i+mid)) l=mid;
				else r=mid-1;
			}
			int p=++l; // diff
			if(check(i,n-i+1,p)) gmx(f[p],i); // 检查修改 p 之后是否相等
			p=n-i+p;
			if(check(i,n-i+1,p)) gmx(f[p],i);
		}
	}
	priority_queue<int> pq;
	rep(i,1,n) {
		// char x=a[i]; a[i]=b[i];
		// rep(j,1,n) pw[j]=pw[j-1]*P,hs[j]=hs[j-1]*P+a[j];
		// int res=0;
		// rep(j,1,n-1) if(ghs(1,j)==ghs(n-j+1,n)) res=j;
		// printf("%d\n",res);
		// a[i]=x;
		int res=f[i];
		if(b[i]==a[i]) gmx(res,ans);
		if(q1[i]) pq.push(q1[i]),st[q1[i]]=1;
		if(q2[i]) st[q2[i]]=0;
		while(pq.size() && !st[pq.top()]) pq.pop();
		if(pq.size()) gmx(res,pq.top());
		printf("%d\n",res);
	}

	return 0;
}