// Author: kyEEcccccc

#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using ULL = unsigned long long;

#define F(i, l, r) for (int i = (l); i <= (r); ++i)
#define FF(i, r, l) for (int i = (r); i >= (l); --i)
#define MAX(a, b) ((a) = max(a, b))
#define MIN(a, b) ((a) = min(a, b))
#define SZ(a) ((int)((a).size()) - 1)

constexpr int N = 1000005;

int sa[N], rk[N];
int tmp[N], tmp2[N];

void build_sa(int n, const string &s)
{
	memset(tmp, 0, 128 * sizeof (int));
	F(i, 1, n) tmp[(int)s[i]] += 1;
	F(i, 1, 127) tmp[i] += tmp[i - 1];
	FF(i, n, 1) sa[tmp[(int)s[i]]--] = i;
	bool ok = false;
	F(i, 1, n)
	{
		if (s[sa[i]] == s[sa[i - 1]]) rk[sa[i]] = rk[sa[i - 1]], ok = true;
		else rk[sa[i]] = i;
	}
	for (int k = 1; ok; k <<= 1)
	{
		// cerr << k << '\n';
		int t = 0;
		F(i, 1, n) if (sa[i] + k > n) tmp2[++t] = sa[i];
		F(i, 1, n) if (sa[i] - k >= 1) tmp2[++t] = sa[i] - k;
		memset(tmp + 1, 0, n * sizeof (int));
		F(i, 1, n) ++tmp[rk[i]];
		F(i, 2, n) tmp[i] += tmp[i - 1];
		FF(i, n, 1) sa[tmp[rk[tmp2[i]]]--] = tmp2[i];
		ok = false;
		F(i, 1, n)
		{
			if (rk[sa[i]] == rk[sa[i - 1]] && (sa[i] + k > n ? 0 : rk[sa[i] + k])
				== (sa[i - 1] + k > n ? 0 : rk[sa[i - 1] + k])) tmp[sa[i]] = tmp[sa[i - 1]], ok = true;
			else tmp[sa[i]] = i;
		}
		memcpy(rk + 1, tmp + 1, n * sizeof (int));
	}
}

signed main(void)
{
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0), cin.tie(nullptr);

	string s;
	cin >> s;
	int n = s.size();
	s = '#' + s;
	build_sa(n, s);
	F(i, 1, n) cout << sa[i] << " \n"[i == n];
	
	return 0;
}