#include <bits/stdc++.h>

using namespace std;

using uubt = unsigned long long;

#define IL inline
#define mkp make_pair
#define fi first
#define se second
using pui = pair<uubt, int>;
IL void ckx(int &x, const int &y) { (x < y) && (x = y); }

const int N = 2e6;
const int maxN = N + 3;

int n;
char s[maxN], t[maxN];

int Br;

const uubt B = 13331;
uubt Pw[maxN], H[maxN];
IL uubt get(int l, int r) {
  return H[r] - H[l - 1] * Pw[r - l + 1];
}

struct Seg {
  uubt t[maxN << 2];
  int len[maxN << 2];
#define ls (p << 1)
#define rs (p << 1 | 1)
  IL void upd(int p) {
    t[p] = Pw[len[rs]] * t[ls] + t[rs];
  }
  void build(int p, int l, int r) {
    len[p] = r - l + 1;
    if (l == r) return t[p] = s[l], void();
    int mid = (l + r) >> 1;
    build(ls, l, mid), build(rs, mid + 1, r);
    upd(p);
  }
  void change(int K, uubt v, int p = 1, int l = 1, int r = n) {
    if (l == r) return t[p] = v, void();
    int mid = (l + r) >> 1;
    K <= mid ? change(K, v, ls, l, mid)
             : change(K, v, rs, mid + 1, r);
    upd(p);
  }
  pui get(int L, int R, int p = 1, int l = 1, int r = n) {
    if (L <= l && r <= R) return mkp(t[p], len[p]);
    int mid = (l + r) >> 1;
    if (R <= mid) return get(L, R, ls, l, mid);
    if (L > mid) return get(L, R, rs, mid + 1, r);
    uubt g = 0;
    auto r1 = get(L, R, ls, l, mid);
    auto r2 = get(L, R, rs, mid + 1, r);
    g = Pw[r2.se] * r1.fi + r2.fi;
    return mkp(g, r1.se + r2.se);
  }
} T;

int ans[maxN];

struct Cov {
  int t[maxN << 2];
  int id[maxN];
  IL void down(int p) {
    if (t[p])
      t[ls] = t[rs] = t[p], t[p] = 0;
  }
  void change(int L, int R, int v, int p, int l, int r) {
    if (L <= l && r <= R) return t[p] = v, void();
    down(p);
    int mid = (l + r) >> 1;
    if (L <= mid) change(L, R, v, ls, l, mid);
    if (R > mid) change(L, R, v, rs, mid + 1, r);
  }
  void dfs(int p, int l, int r) {
    if (l == r) return id[l] = t[p], void();
    down(p);
    int mid = (l + r) >> 1;
    dfs(ls, l, mid), dfs(rs, mid + 1, r);
  }
} cv;

int main() {
  cin >> (s + 1) >> (t + 1);
  n = strlen(s + 1);

  Pw[0] = 1;
  for (int i = 1; i <= n; i++)
    Pw[i] = Pw[i - 1] * B, H[i] = H[i - 1] * B + s[i];

  T.build(1, 1, n);

  for (int i = 1; i < n; i++) {
    if (get(1, i) == get(n - i + 1, n)) {
      Br = i;
      if (i + 1 <= n - i)
        cv.change(i + 1, n - i, i, 1, 1, n);
      continue;
    }
    int l = 1, r = i, h = 1;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (get(1, mid) == get(n - i + 1, n - i + mid))
        l = mid + 1, h = mid + 1;
      else r = mid - 1;
    }
    
    T.change(h, t[h]);
    if (T.get(1, i) == T.get(n - i + 1, n))
      ans[h] = i;
    T.change(h, s[h]);

    int p = n - i + h;
    T.change(p, t[p]);
    if (T.get(1, i) == T.get(n - i + 1, n))
      ans[p] = i;
    T.change(p, s[p]);
  }
  cv.dfs(1, 1, n);

  for (int i = 1; i <= n; i++)
    if (s[i] == t[i])
      cout << Br << '\n';
    else
      cout << max(cv.id[i], ans[i]) << '\n';
}