#include <stdio.h>
#include <string.h>
#include <numeric>
#include <ctype.h>
#include <algorithm>
#define getchar getchar_unlocked
#define putchar putchar_unlocked
using namespace std;
#define MAXN 1000005
void input_str(char *s) {
    int len = 0;
    char c = getchar();

    while (!isalnum(c))
        c = getchar();

    while (isalnum(c))
        s[len++] = c, c = getchar();

    s[len] = '\0';
}
void wr(int x) {
    if (x < 0)
        putchar('-'), x = -x;

    if (x > 9)
        wr(x / 10);

    putchar(x % 10 + 48);
}
int s[(MAXN << 1) + 5], SA[MAXN + 5], Rank[MAXN + 5], c[MAXN + 5], p[MAXN + 5], tmp[MAXN + 5], n, m, hei[MAXN];
char str[MAXN + 5];
bool t[(MAXN << 1) + 5];
void SAIS(int s[], bool t[], int tmp[], int n, int m) {
    int n1 = 0, m1 = Rank[1] = 0, *s1 = s + n;
    t[n] = 0;

    for (int i = n - 1; i; t[i] = s[i] ^ s[i + 1] ? s[i] > s[i + 1] : t[i + 1], i--)
        ;

    for (int i = 2; i <= n; Rank[i] = t[i - 1] && !t[i] ? tmp[++n1] = i, n1 : 0, i++)
        ;

    memset(SA + 1, 0, n << 2);                                                       
    memset(c + 1, 0, m << 2);                                                        
    for (int i = 1; i <= n; ++c[s[i++]])                                            
        ;                                                                            
    partial_sum(c + 1, c + m + 1, c + 1);                                            
    memcpy(p + 1, c + 1, m << 2);                                                    
    for (int i = n1; i;SA[p[s[tmp[i]]]--] = tmp[i], i--)                                         
        ;                                                                            
    transform(c, c + m, p + 1, [](int a) { return ++a; });                           
    for (int i = 1; i <= n; SA[i] > 1 && t[SA[i] - 1] ? (SA[p[s[SA[i] - 1]]++] = SA[i] - 1) : 0, i++) 
        ;                                                                            
    memcpy(p + 1, c + 1, m << 2);                                                    
    for (int i = n; i; SA[i] > 1 && !t[SA[i] - 1] ? (SA[p[s[SA[i] - 1]]--] = SA[i] - 1) : 0, i--)     
        ;


    for (int i = 1, x, y = 0; i <= n; i++)
        if (x = Rank[SA[i]]) {
            if (m1 <= 1 || tmp[x + 1] - tmp[x] != tmp[y + 1] - tmp[y])
                ++m1;
            else
                for (int a = tmp[x], b = tmp[y]; a <= tmp[x + 1]; a++, b++)
                    if ((s[a] << 1 | t[a]) ^ (s[b] << 1 | t[b])) {
                        ++m1;
                        break;
                    }

            s1[y = x] = m1;
        }

    if (m1 < n1)
        SAIS(s1, t + n, tmp + n1, n1, m1);
    else
        for (int i = 1; i <= n1; SA[s1[i]] = i, i++)
            ;

    for (int i = 1; i <= n1; s1[i] = tmp[SA[i]], i++)
        ;

    memset(SA + 1, 0, n << 2);                                                       
    memset(c + 1, 0, m << 2);                                                        
    for (int i = 1; i <= n; ++c[s[i++]])                                            
        ;                                                                           
    partial_sum(c + 1, c + m + 1, c + 1);                                            
    memcpy(p + 1, c + 1, m << 2);                                                    
    for (int i = n1; i; SA[p[s[s1[i]]]--] = s1[i], i--)                                         
        ;                                                                            
    transform(c, c + m, p + 1, [](int a) { return ++a; });                           
    for (int i = 1; i <= n; SA[i] > 1 && t[SA[i] - 1] ? (SA[p[s[SA[i] - 1]]++] = SA[i] - 1) : 0, i++) 
        ;                                                                            
    memcpy(p + 1, c + 1, m << 2);                                                    
    for (int i = n; i; SA[i] > 1 && !t[SA[i] - 1] ? (SA[p[s[SA[i] - 1]]--] = SA[i] - 1) : 0, i--)     
        ;

}
int trans_char(const char &c) {
    if (c >= '0' && c <= '9')
        return c - '0' + 2;
    else if (c >= 'A' && c <= 'Z')
        return c - 'A' + 12;
    else if (c >= 'a' && c <= 'z')
        return c - 'a' + 38;
    else
        return 1;
}
int main() {
    input_str(str + 1);
    n = strlen(str + 1);

    for (int i = 1; i <= n; i++)
        s[i] = trans_char(str[i]);

    s[++n] = 1;
    SAIS(s, t, tmp, n, 63);
    --n;

    for (int i = 1; i <= n; i++)
        SA[i] = SA[i + 1], Rank[SA[i]] = i;

    for (int i = 1, k = 0; i <= n; hei[Rank[i]] = k, i++, k && --k)
        for (int j = SA[Rank[i] - 1]; s[i + k] == s[j + k]; k++)
            ;

    for (int i = 1; i <= n; i++)
        wr(SA[i]), putchar(' ');

    // putchar('\n');
    // for (rint i = 2; i <= n; i++)
    // wr(hei[i]), putchar(' ');
}