// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010
namespace str {
vector<int> prefix_function(string s) {
vector<int> pi(s.length(), 0);
rep(i, 1, s.length()) {
int j = pi[i-1];
while (j && s[i] != s[j]) j = pi[j-1];
pi[i] = j + (s[i] == s[j]);
}
return pi;
}
vector<int> z_function(string s) {
int n = s.length();
vector<int> z(n);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r && z[i-l] < r-i+1) z[i] = z[i-l];
else {
z[i] = max(r-i+1, 0ll);
while (i+z[i] < n && s[z[i]] == s[i+z[i]]) ++ z[i];
}
if (i+z[i]-1 > r) l = i, r = i+z[i]-1;
}
return z;
}
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
string s; cin >> s;
auto z = str::z_function(s);
auto pi = str::prefix_function(s);
rep(i, 0, sz(z)) printf("%lld%s", z[i], i==sz(z)-1?"\n":" ");
rep(i, 0, sz(pi)) printf("%lld%s", pi[i], i==sz(pi)-1?"\n":" ");
return 0;
}
No Comments