1 //#include<bits/stdc++.h>
 2 #include<cstdio>
 3 #include<queue>
 4 #include<cstring>
 5 using namespace std;
 6 const int maxn = 1e6 + 10;
 7 typedef long long ll;
 8 struct node
 9 {
10     char c;
11     int pos, len;
12     node(char c, int pos, int len):c(c), pos(pos), len(len){}
13     bool operator <(const node& a)const
14     {
15         return len < a.len || len == a.len && pos > a.pos;//优先队列
16     }
17 };
18 char s[maxn];
19 int pre[maxn], next[maxn];
20 bool vis[maxn];
21 priority_queue<node>q;
22 int main()
23 {
24     scanf("%s", s);
25     int n = strlen(s);
26     for(int i = 0; i < n;)
27     {
28         int st = i, len = 1;
29         while(s[++i] == s[st])len++;
30         //cout<<s[st]<<" "<<st<<" "<<len<<endl;
31         q.push(node(s[st], st, len));
32     }
33     for(int i = 0; i < n; i++)
34     {
35         pre[i] = i - 1, next[i] = i + 1;
36     }
37     memset(vis, 0, sizeof(vis));
38     while(!q.empty())
39     {
40         node now = q.top();
41         q.pop();
42         if(now.len <= 1)break;
43         if(vis[now.pos])continue;
44         printf("%c", now.c);
45         int head = pre[now.pos], tail = now.pos;
46         for(int i = 0; i < now.len; i++, tail = next[tail])
47         {
48             vis[tail] = 1;
49             printf(" %d", tail + 1);
50         }
51         puts("");
52         if(head >= 0)next[head] = tail;
53         if(tail < n)pre[tail] = head;
54         if(head < 0 || tail >= n || s[head] != s[tail])continue;
55
56         int len = 2;
57         while(pre[head] >= 0 && s[pre[head]] == s[head])
58             head = pre[head], len++;
59         while(next[tail] < n && s[next[tail]] == s[tail])
60             tail = next[tail], len++;
61         q.push(node(s[head], head, len));
62     }
63     return 0;
64 }