#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
template <unsigned long long umod>
struct modint {/*{{{*/
  static constexpr LL mod = umod;
  unsigned long long v;
  modint() = default;
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
    modint(const T& y) : v((unsigned long long)(y % mod + (is_signed<T>() && y < 0 ? mod : 0))) {}
  modint& operator+=(const modint& rhs) { v += rhs.v; if (v >= umod) v -= umod; return *this; }
  modint& operator-=(const modint& rhs) { v -= rhs.v; if (v >= umod) v += umod; return *this; }
  modint& operator*=(const modint& rhs) { v = (unsigned long long)((unsigned __int128)v * rhs.v % umod); return *this; }
  modint& operator/=(const modint& rhs) { assert(rhs.v); return *this *= qpow(rhs, mod - 2); }
  friend modint operator+(modint lhs, const modint& rhs) { return lhs += rhs; }
  friend modint operator-(modint lhs, const modint& rhs) { return lhs -= rhs; }
  friend modint operator*(modint lhs, const modint& rhs) { return lhs *= rhs; }
  friend modint operator/(modint lhs, const modint& rhs) { return lhs /= rhs; }
  template <class T> friend modint qpow(modint a, T b) {
    modint r = 1;
    for (assert(b >= 0); b; b >>= 1, a *= a) if (b & 1) r *= a;
    return r;
  }
  friend LL raw(const modint& self) { return self.v; }
  friend ostream& operator<<(ostream& os, const modint& self) { return os << raw(self); }
  explicit operator bool() const { return v != 0; }
  modint operator-() const { return modint(0) - *this; }
  bool operator==(const modint& rhs) const { return v == rhs.v; }
  bool operator!=(const modint& rhs) const { return v != rhs.v; }
};/*}}}*/
using mint = modint<4051045342144784857>;
constexpr int N = 2e6 + 10;
template <int B>
struct hashTable {
  mint sum[N], bas[N];
  void build(char a[], int n) {
    sum[0] = 0;
    for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] * B + a[i];
    bas[0] = 1;
    for (int i = 1; i <= n; i++) bas[i] = bas[i - 1] * B;
  }
  mint operator()(int l, int r) const {
    return sum[r] - sum[l - 1] * bas[r - l + 1];
  }
};
int n, ans[N], z[N], tg[N];
char a[N], b[N];
hashTable<830483> hsh;
void exkmp() {
  z[1] = n;
  for (int i = 2, l = 1, r = 0; i <= n; i++) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l + 1]);
    else z[i] = 0;
    while (i + z[i] <= n && a[1 + z[i]] == a[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) r = i + z[l = i] - 1;
  }
}
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  cin >> a >> b;
  n = (int)strlen(a);
  memmove(a + 1, a, sizeof(char) * n);
  memmove(b + 1, b, sizeof(char) * n);
  exkmp();
  int maxb = 0;
  hsh.build(a, n);
  for (int i = 1; i < n; i++) {
    int lcp = z[n - i + 1];
    if (lcp >= i) {
      maxb = i;
      if (i + 1 <= (n + 1) / 2) tg[i + 1] = tg[n - i] = i;
    } else {
      for (int pos : {1 + lcp, n - i + 1 + lcp}) {
        if (a[pos] == b[pos]) continue;
        auto split = [&](int l, int r) {
          auto ret = hsh(l, r);
          if (l <= pos && pos <= r) ret += (b[pos] - a[pos]) * hsh.bas[r - pos];
          return ret;
        };
        if (split(1, i) == split(n - i + 1, n)) ans[pos] = i;
      }
    }
  }
  for (int i = 1; i <= (n + 1) / 2; i++) tg[i] = max(tg[i - 1], tg[i]);
  for (int i = n; i >= (n + 1) / 2; i--) tg[i] = max(tg[i + 1], tg[i]);
  for (int i = 1; i <= n; i++) ans[i] = max(ans[i], tg[i]);
  for (int i = 1; i <= n; i++) if (a[i] == b[i]) ans[i] = max(ans[i], maxb);
  for (int i = 1; i <= n; i++) cout << ans[i] << endl;
  return 0;
}