#include<bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("-frename-registers")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
using namespace std;
#define rep(i,s,t,p) for(int i = s;i <= t;i += p)
#define drep(i,s,t,p) for(int i = s;i >= t;i -= p)
char *p1,*p2,buf[1<<20];
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#ifdef linux
#define pc putchar_unlocked
#else
#define pc putchar
#endif
namespace IO{
    template<typename T>inline bool read(T &x){x=0;char s=gc();bool f=true;for(;(s<'0'||'9'<s);s=gc()) {if(s=='-') f=false;if(s==EOF)return false;}for(;'0'<=s&&s<='9';s=gc()) x=(x<<1)+(x<<3)+(s^48);if(!f) x=~x+1;return true;}
    inline bool read(double &x){x=0.0;char s=gc();bool f=true;for(;(s<'0'||'9'<s);s=gc()){if(s=='-') f=false;if(s==EOF)return false;}for(;'0'<=s&&s<='9';s=gc())x=(x*10)+(s^48);if(s!='.'){x=f?x:-x;return true;}double res=0.1;s=gc();for(;'0'<=s&&s<='9';res/=10,s=gc()) x+=(s^48)*res;x=f?x:-x;return true;}
    inline bool read(long double &x){x=0.0;char s=gc();bool f=true;for(;(s<'0'||'9'<s);s=gc()){if(s=='-') f=false;if(s==EOF)return false;}for(;'0'<=s&&s<='9';s=gc())x=(x*10)+(s^48);if(s!='.'){x=f?x:-x;return true;}double res=0.1;s=gc();for(;'0'<=s&&s<='9';res/=10,s=gc()) x+=(s^48)*res;x=f?x:-x;return true;}
    inline bool read(float &x){x=0.0;char s=gc();bool f=true;for(;(s<'0'||'9'<s);s=gc()){if(s=='-') f=false;if(s==EOF)return false;}for(;'0'<=s&&s<='9';s=gc())x=(x*10)+(s^48);if(s!='.'){x=f?x:-x;return true;}double res=0.1;s=gc();for(;'0'<=s&&s<='9';res/=10,s=gc()) x+=(s^48)*res;x=f?x:-x;return true;}
    inline bool read(string &str){string ().swap(str);char s=gc();for(;s==' '||s=='\n'||s == '\r';s=gc());if(s==EOF) return false; for(;s!=' '&&s!='\n'&&s!='\r'&&s!=EOF;s=gc())str.push_back(s);return true;}
    inline bool read_line(string &str){string ().swap(str);char s=gc();for(;s==' '||s=='\n'||s=='\r';s=gc());if(s==EOF) return false;for(;s!='\n'&&s!='\r'&&s!=EOF;s=gc()){str.push_back(s);}return true;}
    inline bool read_line(char *str){int len=0;char s=gc();for(;s==' '||s=='\n'||s=='\r';s=gc());if(s==EOF) return false;for(;s!='\n'&&s=='\r'&&s!=EOF;s=gc()){str[len]=s;len++;}str[len]='\0';return true;}
    inline bool read(char &s){char x=gc();for(;x==' '||x=='\n'||x=='\r';x=gc());if(x==EOF||x==' '||x=='\n'||x=='\r')return false;s=x;return true;}
    inline bool read(char *s){int len=0;char x=gc();for(;x==' '||x=='\n'||x=='\r';x=gc());if(x==EOF)return false;for(;x!=' '&&x!='\n'&&x!='\r'&&x!=EOF;x=gc())s[len++]=x;s[len]='\0';return true;}
    template<class T,class... Args> inline bool read(T &x,Args&... args){return (read(x)&&read(args...));}
    template<class T>inline void write(T x){static T st[45];int top=0;if(x<0)x=~x+1,pc('-');do{st[top++]=x%10;}while(x/=10);while(top)pc(st[--top]^48);}
    inline void write(char x){pc(x);}
    inline void write(string s){for(int i=0;s[i];++i) pc(s[i]);}
    inline void write(char *s){int len=strlen(s);for(int i=0;i<len;++i) pc(s[i]);}
    inline void write(const char *s){int len=strlen(s);for(int i=0;i<len;++i) pc(s[i]);}
    template<class T,class... Args> inline void write(T x,Args... args){write(x);write(args...);}
}using namespace IO;
using ll = long long;using ull = unsigned long long;
using db = long double;using ldb = long double;
const int N = 2e6 + 10;
const ull base = 2707;
int n,m,ans[N];ull pw[N];
char s[N],t[N];
struct Hash{
  ull h[N];int n;
  inline void init(char *s,int len){
    n = len;
    rep(i,1,n,1) h[i] = h[i-1]*base + s[i];
  }
  inline ull get(int l,int r){return h[r] - h[l-1]*pw[r-l+1];}
}hs;
set<int> st;
inline void getoriginal(){
  rep(len,1,n-1,1) if(hs.get(1,len) == hs.get(n-len+1,n)) st.emplace(len);
}
struct Segment_Tree{
  struct node{
    int l,r,len;ull val;
    node(){}
    node(int L,int R,int N,ull V):l(L),r(R),len(N),val(V){}
#define l(x) t[x].l
#define r(x) t[x].r
#define len(x) t[x].len
#define val(x) t[x].val
  }t[N<<2];
  inline ull M(int x,int y){return val(x)*pw[len(y)]+val(y);}
  struct Qn{int len;ull val;Qn(int L,ull V){len = L,val = V;}};
  inline Qn Mg(Qn x,Qn y){return Qn(x.len + y.len,x.val*pw[y.len] + y.val);}
  inline void P(int k){t[k].val = M(k<<1,k<<1|1);}
  void B(int k,int l,int r){
    l(k) = l,r(k) = r;len(k) = r - l + 1;
    if(l == r) return val(k) = s[l],void();
    int mid = (l + r) >> 1;
    B(k<<1,l,mid);B(k<<1|1,mid+1,r);P(k);
  }
  void upd(int k,int pos,char x){
    if(l(k) == r(k)) return val(k) = x,void();
    int mid = (l(k) + r(k)) >> 1;
    pos <= mid?upd(k<<1,pos,x):upd(k<<1|1,pos,x);P(k);
  }
  Qn qry(int k,int l,int r){
    if(l <= l(k) && r(k) <= r) return Qn(t[k].len,t[k].val);
    int mid = (l(k) + r(k)) >> 1;
    if(r <= mid) return qry(k<<1,l,r);
    if(l > mid) return qry(k<<1|1,l,r);
    return Mg(qry(k<<1,l,mid),qry(k<<1|1,mid+1,r));
  }
#undef l
#undef r
#undef val
#undef len
}sgt;
signed main(){
  // cin.tie(nullptr)->sync_with_stdio(false);
  read(s+1);read(t+1);n = strlen(s+1);
  pw[0] = 1;rep(i,1,n,1) pw[i] = pw[i-1]*base;
  hs.init(s,n);sgt.B(1,1,n);
  getoriginal();
  ans[0] = st.size()?*st.rbegin():0;
  rep(i,1,n,1) if(s[i] == t[i]) ans[i] = ans[0];
  rep(len,1,n,1){
    int l = 1,r = len,p = 0;
    while(l <= r){
      int mid = (l + r) >> 1;
      if(hs.get(1,mid) == hs.get(n-len+1,n-len+mid)){
        p = mid,l = mid + 1;
      }
      else r = mid - 1;
    }
    int r1 = n - len + p + 1;
    int r2 = p + 1;
    if(r1 <= n){
      sgt.upd(1,r1,t[n-len+1+p]);
      if(sgt.qry(1,1,len).val == sgt.qry(1,n-len+1,n).val)
        ans[r1] = max(len,ans[r1]);
      sgt.upd(1,r1,s[n-len+1+p]);
    }
    if(r2 <= n){
      sgt.upd(1,r2,t[r2]);
      if(sgt.qry(1,1,len).val == sgt.qry(1,n-len+1,n).val) 
        ans[r2] = max(len,ans[r2]);
      sgt.upd(1,r2,s[r2]);
    }
  }
  rep(i,1,n,1){
    int res = 0;
    if(s[i] != t[i] && st.size()){
      auto it = st.upper_bound(min(i-1,n-i));
      if(it != st.begin()) it--,res = *it;
    }
    write(max(ans[i],res),'\n');
  }
}