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

vector<int> getZ(string s){
    int n = s.size();
    vector<int> z(n);
    for (int i = 1, l = 0, r = 0; i < n; ++i){
        if (i <= r && z[i - l] < r - i + 1) z[i] = z[i - l];
        else{
            z[i] = max(0, r - i + 1);
            while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
        }
        if (i + z[i] - 1 > r)
            l = i, r = i + z[i] - 1;
    }
    return z;
}

string s, t;
void solve(){
    int n = s.size(), m = t.size();
    auto Zts = getZ(t + "#" + s), Zst = getZ(s + "#" + t), Zs = getZ(s);
    int res = 0;
    for (int i = n + 1; i < n + m + 1; i++){
        int t = n + m - i + 1;
        if (Zst[i] == t) res = max(Zst[i], res);
    }

    int tt = 0;
    for (int i = 1; i < n; i++){
        if (Zs[i] == n - i){
            tt = Zs[i];
            break;
        }
    }

    vector<int> id; // t in s index
    vector<int> ans(n + 1, res);
    for (int i = 0; i < n; i++){
        if (Zts[i + m + 1] == m){
            id.push_back(i);
            ans[i] = max(ans[i], i + m);
        }
    }

    for (int i = 0; i < n - 1; i++){
        int pre = upper_bound(id.begin(), id.end(), Zs[i]) - id.begin();
        if (pre){
            while (pre--){
                if (ans[i + id[pre]] >= id[pre] + m) break;
                ans[i + id[pre]] = id[pre] + m;
            } ;
        }
    }
    
    ans.pop_back();

    for (auto i : ans) cout << (i != n ? i : tt) << " ";
    cout << '\n';
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    while (cin >> s >> t)
        solve();
}