#include<bits/stdc++.h>
using namespace std;

int n;
string s,t;

struct SUB1{
	#define ull unsigned long long
	
	ull bas=131,mod=988244853,hs[5010][5010],pw[5010];
	
	void ini(){
		pw[0]=1;
		for(int i=1;i<=n;i++) pw[i]=pw[i-1]*bas;
		for(int i=1;i<=n;i++){
			string tmp=s;
			tmp[i]=t[i];
			for(int j=1;j<=n;j++){
				hs[i][j]=hs[i][j-1]*bas+tmp[j];
//				cout<<i<<" "<<j<<" "<<hs[i][j]<<endl;
			}
//			for(int j=0;j<=n;j++) cout<<i<<" "<<j<<" "<<hs[i][j]<<endl;
		}
	}
	
	inline ull get_hs(int id,int l,int r){
		ull tmp=hs[id][r]-hs[id][l-1]*pw[r-l+1];
//		cout<<tmp<<endl;
		return tmp;
	}
	
	inline bool ok(int id,int len){return get_hs(id,1,len)==get_hs(id,n-len+1,n);}
	
	void solve(){
		ini();
		for(int i=1;i<=n;i++){
			int j=n;
			for(j=n-1;j>=1;j--){
				if(ok(i,j)) break;
			}
			cout<<j<<endl;
		}
	}
	
	#undef ull
	
}sub1;

int main(){
	cin>>s>>t;
	n=s.length();
	s=" "+s;
	t=" "+t;
	if(n<=5000) sub1.solve();
	
	
	return 0;
}