#line 1 "verify/yosupo/string/suffix-array/suffixarray.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/suffixarray"
#line 2 "template.hpp"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double;
using i128 = __int128_t;
using u32 = uint32_t;
using u64 = uint64_t;
template<class T>
using PQ = priority_queue<T,vector<T>,greater<T>>;
const int INF=INT_MAX/2;
const ll LINF=LLONG_MAX/4;
const db DINF=numeric_limits<db>::infinity();
const db EPS=1e-9;
const db PI=acos(db(-1));
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define SZ(a) (int)(a.size())
#define SORT(a) sort(ALL(a))
#define RSORT(a) sort(RALL(a))
#define REV(a) reverse(ALL(a))
#define UNI(a) a.erase(unique(ALL(a)),a.end())
#define LB(a,x) (int)(lower_bound(ALL(a),x)-a.begin())
#define UB(a,x) (int)(upper_bound(ALL(a),x)-a.begin())
#define FIND(a,x) (int)(find(ALL(a),x)-a.begin())
#define COUNT(a,x) (int)count(ALL(a),x)
#define MIN(a) *min_element(ALL(a))
#define MAX(a) *max_element(ALL(a))
template<class T,class U>
bool chmin(T &a,U b){return b<a?a=b,1:0;}
template<class T,class U>
bool chmax(T &a,U b){return a<b?a=b,1:0;}
template<class T>
T floor(T a,T b){return a/b-((a^b)<0&&a%b);}
template<class T>
T ceil(T a,T b){return a/b+((a^b)>=0&&a%b);}
int popcnt(ll x){return __builtin_popcountll(x);}
int topbit(ll x){return x==0?-1:63-__builtin_clzll(x);}
int lowbit(ll x){return x==0?-1:__builtin_ctzll(x);}
template<class T,class U>
T SUM(const U &a){return accumulate(ALL(a),T{});}
template<class T>
vector<int> argsort(const vector<T> &a){
vector<int> p(SZ(a));
iota(ALL(p),0);
stable_sort(ALL(p),[&](int i,int j){return a[i]<a[j];});
return p;
}
template<class T,size_t D=0>
struct VecBuilder{
array<size_t,D> d;
VecBuilder<T,D+1> operator[](size_t n)const{
VecBuilder<T,D+1> res{};
for(size_t i=0;i<D;i++)res.d[i]=d[i];
res.d[D]=n;
return res;
}
template<size_t I=0>
auto build(const T &x)const{
if constexpr(I+1==D)return vector<T>(d[I],x);
else return vector<decltype(build<I+1>(x))>(d[I],build<I+1>(x));
}
auto operator()(const T &x=T())const{
static_assert(D>0);
return build(x);
}
};
template<class T>
inline constexpr VecBuilder<T> VEC{};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
#line 2 "data-structure/sparse-table.hpp"
/**
* Author: Teetat T.
* Date: 2024-06-12
* Description: Sparse Table class.
*/
template<class Monoid>
struct SparseTable{
using T = typename Monoid::value_type;
int n;
vector<vector<T>> t;
SparseTable(){}
SparseTable(const vector<T> &a){init(a);}
void init(const vector<T> &a){
n=(int)a.size();
int lg=31-__builtin_clz(n);
t.assign(lg+1,vector<T>(n,Monoid::unit()));
t[0]=a;
for(int i=0;i<lg;i++){
for(int j=0;j+(2<<i)<=n;j++){
t[i+1][j]=Monoid::op(t[i][j],t[i][j+(1<<i)]);
}
}
}
T query(int l,int r){
int lg=31-__builtin_clz(r-l+1);
return Monoid::op(t[lg][l],t[lg][r-(1<<lg)+1]);
}
};
#line 2 "group/monoid/min.hpp"
/**
* Author: Teetat T.
* Date: 2024-04-14
* Description: Min Monoid class.
*/
template<class T>
struct MinMonoid{
using value_type = T;
static constexpr T op(const T &x,const T &y){return min(x,y);}
static constexpr T unit(){return numeric_limits<T>::max();}
};
#line 4 "string/suffix-array.hpp"
/**
* Author: Teetat T.
* Date: 2024-06-14
* Description: Suffix Array.
*/
template<class STR>
struct SuffixArray{
int n;
vector<int> sa,isa,lcp;
SparseTable<MinMonoid<int>> st;
SuffixArray(){}
SuffixArray(const STR &s){init(s);}
void init(const STR &s){
n=(int)s.size();
sa=isa=lcp=vector<int>(n+1);
sa[0]=n;
iota(sa.begin()+1,sa.end(),0);
sort(sa.begin()+1,sa.end(),[&](int i,int j){return s[i]<s[j];});
for(int i=1;i<=n;i++){
int x=sa[i-1],y=sa[i];
isa[y]=i>1&&s[x]==s[y]?isa[x]:i;
}
for(int len=1;len<=n;len<<=1){
vector<int> ps(sa),pi(isa),pos(n+1);
iota(pos.begin(),pos.end(),0);
for(auto i:ps)if((i-=len)>=0)sa[pos[isa[i]]++]=i;
for(int i=1;i<=n;i++){
int x=sa[i-1],y=sa[i];
isa[y]=pi[x]==pi[y]&&pi[x+len]==pi[y+len]?isa[x]:i;
}
}
for(int i=0,k=0;i<n;i++){
for(int j=sa[isa[i]-1];j+k<n&&s[j+k]==s[i+k];k++);
lcp[isa[i]]=k;
if(k)k--;
}
st.init(lcp);
}
int get_lcp(int i,int j){
if(i==j)return n-i;
auto [l,r]=minmax(isa[i],isa[j]);
return st.query(l+1,r);
}
};
#line 4 "verify/yosupo/string/suffix-array/suffixarray.test.cpp"
int main(){
string s;
cin >> s;
SuffixArray sa(s);
for(int i=1;i<=s.size();++i)cout << sa.sa[i] << " ";
}
verify/yosupo/string/suffix-array/suffixarray.test.cpp