UVA120

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<map> 
#include<set>
#include<sstream>
using namespace std;

int n;
int stack[35];
void flip(int p)
{
    for (int i = 0; i < p - i; i++)
    {
        swap(stack[i], stack[p - i]);
    }
    printf("%d ", n-p);
}
int main()
{
    string s;
    while (getline(cin, s))
    {
        cout << s << endl;
        stringstream ss(s);
        n = 0;
        while (ss >> stack[n])
        {
            n++;
        }
        for (int i = n - 1; i >= 0; i--)
        {
            int p = max_element(stack, stack + i + 1) - stack;
            if (i == p)continue;
            if (p > 0)flip(p);
            flip(i);
        }
        printf("0\n");
    }
    return 0;
}