#include <bits/stdc++.h>

using namespace std;
const int maxn = 1e6 + 5;
const int inf = 1e9;

struct SA {
    int dp[maxn][20], sa[maxn], rak[maxn];
    int tx[maxn], height[maxn], lg[maxn];
    int n, m, p;
    char s[maxn];
    struct node {
        int x, y, id;
    } a[maxn], b[maxn];

    void rsort() {
        for (int i = 1; i <= m; i++) tx[i] = 0;
        for (int i = 1; i <= n; i++) tx[a[i].y]++;
        for (int i = 1; i <= m; i++) tx[i] += tx[i - 1];
        for (int i = 1; i <= n; i++) b[tx[a[i].y]--] = a[i];
        for (int i = 1; i <= m; i++) tx[i] = 0;
        for (int i = 1; i <= n; i++) tx[b[i].x]++;
        for (int i = 1; i <= m; i++) tx[i] += tx[i - 1];
        for (int i = n; i >= 1; i--) a[tx[b[i].x]--] = b[i];
    }

    void ssort() {
        rsort();
        p = 0;
        for (int i = 1; i <= n; i++) {
            if (a[i].x != a[i - 1].x || a[i].y != a[i - 1].y) ++p;
            rak[a[i].id] = p;
        }
        for (int i = 1; i <= n; i++) {
            a[i].x = rak[i];
            a[i].id = sa[rak[i]] = i;
            a[i].y = 0;
        }
        m = p;
    }

    void solve() {
        m = 500;//修改
        for (int i = 1; i <= n; i++) {
            a[i].x = a[i].y = s[i];a[i].id = i;
        }
        ssort();
        for (int j = 1; j <= n; j <<= 1) {
            for (int i = 1; i + j <= n; i++) a[i].y = a[i + j].x;
            ssort();
            if (p == n) break;
        }
    }

    void get_Height() {
        int k = 0;
        for (int i = 1; i <= n; i++) {
            if (k) k--;
            int j = sa[rak[i] - 1];
            while (i + k <= n && j + k <= n && s[i + k] == s[j + k]) k++;
            height[rak[i]] = k;
        }
    }

    void RMQ() {
        for (int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
        for (int i = 1; i <= n; i++) dp[i][0] = height[i];
        for(int j = 1; j <= lg[n]; j++) {
            for(int i = 1; i + (1 << j) - 1 <= n; i++) {
                dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
            }
        }
    }

    int lcp(int x, int y) {
        int l = rak[x], r = rak[y];
        if (l > r) swap(l, r);
        l++;
        int k = lg[r - l + 1];
        return min(dp[l][k], dp[r - (1 << k) + 1][k]);
    }

    int min(int l, int r) {
        if (l == r) return dp[l][0];
        if (l > r) swap(l, r);
        int k = lg[r - l + 1];
        return min(dp[l][k], dp[r - (1 << k) + 1][k]);
    }
} sa;



int main() {
    //freopen("in.in", "r", stdin);
//    freopen("out1.out", "w", stdout);
    scanf("%s", sa.s + 1);
    sa.n = strlen(sa.s + 1);
    sa.solve();
    for (int i = 1; i <= sa.n; i++) {
        printf("%d ", sa.sa[i]);
    }
    return 0;
}