#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 1000005;
const int INF = 0x3f3f3f3f;
char s[N];
int sa[N];
int rk[N << 1], tk[N << 1];
int id[N], cnt[N];
int main() {
    scanf("%s", s + 1);
    int n = strlen(s + 1);
    for (int i = 1; i <= n; i++) {
        sa[i] = i;
        rk[i] = s[i];
    }
    int m = 'z';
    for (int i = 1; i <= n; i++) cnt[rk[i] = s[i]]++;
    for (int i = 1; i <= m; i++) cnt[i] += cnt[i - 1];
    for (int i = n; i >= 1; i--) sa[cnt[rk[i]]--] = i;
    for (int w = 1; w < n; w *= 2) {
        int p = 0;
        for (int i = n - w + 1; i <= n; i++) id[++p] = i;
        for (int i = 1; i <= n; i++) {
            if (sa[i] > w) id[++p] = sa[i] - w;
        }
        for (int i = 1; i <= m; i++) cnt[i] = 0;
        for (int i = 1; i <= n; i++) cnt[rk[i]]++;
        for (int i = 1; i <= m; i++) cnt[i] += cnt[i - 1];
        for (int i = n; i >= 1; i--) sa[cnt[rk[id[i]]]--] = id[i];
        m = 0;
        for (int i = 1; i <= n; i++) {
            if (rk[sa[i]] == rk[sa[i - 1]] && rk[sa[i] + w] == rk[sa[i - 1] + w]) {
                tk[sa[i]] = m;
            } else {
                tk[sa[i]] = ++m;
            }
        }
        for (int i = 1; i <= n; i++) rk[i] = tk[i];
    }
    for (int i = 1; i <= n; i++) printf("%d%c", sa[i], " \n"[i == n]);
    return 0;
}