#include <bits/stdc++.h>

using namespace std;

// #define LOCK_GETCHAR
// #define USE_INT_128

#if __cplusplus < 201400
#warning "Please use c++14 or higher."
#define CONSTEXPR_FUNC
#define ENABLE_IF_INT
#else
#define CONSTEXPR_FUNC constexpr
#define ENABLE_IF_INT , enable_if_t<_is_integer<T>, int> = 0
template <class T> constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <> constexpr bool _is_integer<bool> = false;
template <> constexpr bool _is_integer<char> = false;
#ifdef USE_INT_128
template <> constexpr bool _is_integer<__int128> = true;
template <> constexpr bool _is_integer<__uint128_t> = true;
#endif
template <class T ENABLE_IF_INT>
constexpr T INF = numeric_limits<T>::max() >> 1;
#endif

#if !defined(_WIN32) && !defined(LOCK_GETCHAR)
#define getchar getchar_unlocked
#endif

#define il inline
#define mkp make_pair
#define fi first
#define se second
#define For(i, j, k) for (decltype(j - k) i = (j); i <= (k); ++i)     // NOLINT
#define ForDown(i, j, k) for (decltype(j - k) i = (j); i >= (k); --i) // NOLINT
#define pb push_back
#define eb emplace_back
#ifndef ONLINE_JUDGE
#define FileIO(filename)                                                       \
  freopen(filename ".in", "r", stdin);                                         \
  freopen(filename ".out", "w", stdout)
#else
#define FileIO(filename) void(0)
#endif

using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#ifdef USE_INT_128
using lll = __int128_t;
using ulll = __uint128_t;
#endif

// clang-format off
#define lg(x) (31 ^ __builtin_clz((x)))
#define lgll(x) (31ll ^ __builtin_clzll((x)))
template<typename T> constexpr il T sq(const T & x){ return x * x; }
template<typename T> CONSTEXPR_FUNC il void cmin(T & x, const T &y){ x = min(x, y); }
template<typename T> CONSTEXPR_FUNC il void cmax(T & x, const T &y){ x = max(x, y);}
template<typename T> CONSTEXPR_FUNC il T qpow(T x, ull y, T mod){T ans = 1; x %= mod; while (y) { if(y & 1)(ans *= x) %= mod;(x *= x) %= mod; y >>= 1;} return ans;}
template<typename T> CONSTEXPR_FUNC il T qpow(T x, ull y){T ans = 1; while (y) {if(y & 1) ans *= x;x *= x;y >>= 1;} return ans;}
template<typename T ENABLE_IF_INT> il void read(T &x){ x = 0; int f = 1; int c = getchar(); while(!isdigit(c)) {if (c == '-') f = -1;c = getchar();} while(isdigit(c)) {x = x * 10 + c - '0';c = getchar();} x *= f;}
template<typename T, typename ... Args> il void read(T &x, Args &... y){ read(x); read(y...); }
int gcd(int a, int b) { if (!a | !b) return a + b; int az = __builtin_ctz(a); int bz = __builtin_ctz(b); int z = min(az, bz); a >>= az, b >>= bz; while (a != b) { int diff = b - a; az = __builtin_ctz(diff); b = min(a, b), a = abs(diff) >> az; } return a << z; }
ll gcd(ll a, ll b) { if (!a | !b) return a + b; ll az = __builtin_ctzll(a); ll bz = __builtin_ctzll(b); ll z = min(az, bz); a >>= az, b >>= bz; while (a != b) { ll diff = b - a; az = __builtin_ctzll(diff); b = min(a, b), a = abs(diff) >> az; } return a << z; }
// clang-format on

// File head end

namespace {
constexpr ll MAXN = 2e6 + 5, m1 = 998244353, m2 = 1e9 + 7, bs1 = 33, bs2 = 37;
int n, ans[MAXN];
string S, T;
ll pw1[MAXN], pw2[MAXN], h1[MAXN], h2[MAXN];
vector<pii> qwq[MAXN];
il ll get_h1(int l, int r) {
  return (m1 + h1[r] - h1[l - 1] * pw1[r - l + 1] % m1) % m1;
}
il ll get_h2(int l, int r) {
  return (m2 + h2[r] - h2[l - 1] * pw2[r - l + 1] % m2) % m2;
}
il pll get_hash(int l, int r) {
  assert(l <= r);
  return {get_h1(l, r), get_h2(l, r)};
}

il string pll2str(const pll &x) {
  return to_string(x.fi) + ", " + to_string(x.se);
}

il void Main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> S >> T, n = S.length(), S = "$" + S, T = "$" + T;
  pw1[0] = 1, pw2[0] = 1;
  For(i, 1, n) pw1[i] = pw1[i - 1] * bs1 % m1;
  For(i, 1, n) pw2[i] = pw2[i - 1] * bs2 % m2;
  For(i, 1, n) h1[i] = (h1[i - 1] * bs1 + S[i] - 'a') % m1,
               h2[i] = (h2[i - 1] * bs2 + S[i] - 'a') % m2;
  vector<int> un_changed;
  For(i, 1, n) if (S[i] == T[i]) un_changed.eb(i);
  int ans2 = 0;

  // cerr << pll2str(get_hash(1, 1)) << '\n';
  // cerr << pll2str(get_hash(6, 6)) << '\n';

  For(x, 1, n - 1) {
    int l = 1, r = x;
    while (l <= r) {
      int m = (l + r) >> 1;
      if (get_hash(1, m) == get_hash(n - x + 1, n - x + m))
        l = m + 1;
      else
        r = m - 1;
    }
    // cerr << x << ' ' << l << ' ' << r << '\n';
    if (l == x + 1) {
      ans2 = x;
      if (x < (n + 1) / 2)
        qwq[x + 1].eb(1, x), qwq[n - x + 1].eb(-1, x);
    } else if (x <= n / 2) {
      bool flg = (l == x) || get_hash(l + 1, x) == get_hash(n - x + l + 1, n);
      if (flg && T[l] == S[n - x + l])
        ans[l] = x;
      if (flg && S[l] == T[n - x + l])
        ans[n - x + l] = x;
    } else {
      int pos1 = l + 1, pos2 = min(x, n - x + l - 1);
      bool flg = (pos1 > pos2) ||
                 get_hash(pos1, pos2) == get_hash(n - x + pos1, n - x + pos2);
      if (pos2 + 1 < x)
        flg &= get_hash(pos2 + 2, x) == get_hash(n - x + pos2 + 2, n);
      if (flg && T[l] == S[n - x + l] &&
          (pos2 == x || S[pos2 + 1] == S[n - x + pos2 + 1]))
        ans[l] = x;
      if (flg && S[l] == T[n - x + l] &&
          (pos2 == x || T[pos2 + 1] == S[n - x + pos2 + 1]))
        ans[n - x + l] = x;
    }
  }
  for (int x : un_changed)
    ans[x] = ans2;
  multiset<int, greater<>> others;
  For(i, 1, n) {
    for (auto [j, k] : qwq[i]) {
      if (j == 1)
        others.emplace(k);
      else
        others.erase(others.find(k));
    }
    if (!others.empty())
      cmax(ans[i], *others.begin());
  }
  For(i, 1, n) cout << ans[i] << '\n';
}
} // namespace

signed main() { return Main(), 0; }