#include <bits/stdc++.h>

#define R register
#define ll long long
#define sum(a, b, mod) (((a) + (b)) % mod)
#define meow(cat...) fprintf(stderr, cat)

const int MaxN = 3e6 + 10;

char s[MaxN];
int n, z[MaxN];

void exkmp()
{
    int l = 0, r = 0; z[1] = n;
    for(int i = 2; i <= n; i++)
    {
        if(r > i) z[i] = std::min(z[i - l + 1], r - i + 1);
        while(i + z[i] <= n && s[i + z[i]] == s[z[i] + 1])
            z[i]++;
        if(i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
    }
}

std::vector<int> now, tmp;

signed main()
{   
    scanf("%s", s + 1);
    n = strlen(s + 1), exkmp();
    for(int i = 1; i <= n; i++)
    {
        now.push_back(i), tmp.clear();
        for(auto p : now)
        {
            int flag = 1;
            while(!tmp.empty())
            {
                int q = tmp.back();
                if(s[i] > s[q + i - p]) flag = 0;
                if(s[i] >= s[q + i - p]) break;
                tmp.pop_back();
            }
            if(flag && (tmp.empty() || i - p + 1 < p - tmp.back()))
                tmp.push_back(p);
        }
        now = tmp; int pos = now[0];
        for(int j = 1; j < now.size(); j++)
        {
            int x = now[j], k = pos + i - x;
            if(z[k + 1] >= i - k)
            {
                int l = i - k;
                if(z[l + 1] < x - l - 1 && s[l + z[l + 1] + 1] < s[z[l + 1] + 1])
                    pos = x;
            }    
            else if(s[z[k + 1] + 1] < s[k + z[k + 1] + 1])
                pos = x;
        }
        printf("%d ", pos);
    }
    return 0;
}