#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define MAXN 110class Flapjacks{private:int jacks[MAXN];int ansJack[MAXN+MAXN];int ansLoop;public:void init();void process();void reserv(int a[],int num);//反转数组操作,num为反转位置void output();
};
void Flapjacks::reserv(int a[],int num){int tempArry[num];for(int loop1 = num - 1,loop2 = 0;loop1 >= 0;loop1--){tempArry[loop2++] = a[loop1];}for(int loop1 = 0;loop1 < num;loop1++){a[loop1] = tempArry[loop1];}
}
void Flapjacks::init(){memset(jacks,0,sizeof(jacks));
}
void Flapjacks::process(){int loop = 0,n;char c;while(scanf("%d%c",&n,&c)!=EOF){if(c != '\n'){printf("%d ",n);jacks[loop++] = n;}else {jacks[loop++] = n;cout<<n<<endl;int clon[MAXN],maxNum;for(int i = 0;i < loop;i++)clon[i] = jacks[i];sort(clon,clon + loop);ansLoop = 0;ansJack[0] = 0;for(int i = loop - 1;i >= 0;i--){maxNum = clon[i];//maxNum 记录当前未正确归位的煎饼if(maxNum == jacks[i]){continue;}else{if(jacks[0] == maxNum){//需要操作的煎饼在最上边时的操作reserv(jacks,i+1);//从loop - i处反转ansJack[ansLoop++] = loop - i;}else{for(int j = 0;j < loop;j++){//需要操作的煎饼在不最上边时的操作if(jacks[j] == maxNum){reserv(jacks,j+1);ansJack[ansLoop++] = loop - j ;break;}}reserv(jacks,i+1);ansJack[ansLoop++] = loop - i;}}}output();loop = 0;init();}}
}
void Flapjacks::output(){for(int i = 0;i < ansLoop;i++){cout<<ansJack[i]<<" ";}cout<<0<<endl;
}int main()
{//#ifndef ONLINE_JUDGE//    freopen("D:\\acm.txt","r",stdin);// #endif // ONLINE_JUDGE
    Flapjacks flapjacks;flapjacks.process();return 0;
}