#include<bits/stdc++.h>

using namespace std;

const int N = ;

int n, kase;

int vis[N * ];

char s[N];

vector<int> dp[N][N];

int main()

{

    while(scanf("%s", s + ))

    {

        if(s[] == '') break;

        n = strlen(s + );

        for(int i = ; i <= n; ++i)

            for(int j = i; j <= n; ++j)

                dp[i][j].clear();

        for(int i = ; i <= n; ++i)

        {

            if(s[i] == 'I') dp[i][i].push_back();

            if(s[i] == 'V') dp[i][i].push_back();

            if(s[i] == 'X') dp[i][i].push_back();

            if(s[i] == 'L') dp[i][i].push_back();

            if(s[i] == 'C') dp[i][i].push_back();

        }

        for(int len = ; len <= n; ++len)

            for(int i = ; i <= n - len + ; ++i)

            {

                for(int j = i; j < i + len; ++j)

                    for(int x = ; x < dp[i][j].size(); ++x)

                        for(int y = ; y < dp[j + ][i + len - ].size(); ++y)

                            if(dp[i][j][x] < dp[j + ][i + len - ][y] && !vis[dp[j + ][i + len - ][y] - dp[i][j][x]])

                            {

                                dp[i][i + len - ].push_back(dp[j + ][i + len - ][y] - dp[i][j][x]);

                                vis[dp[j + ][i + len - ][y] - dp[i][j][x]] = ;

                             }

                            else if(dp[i][j][x] >= dp[j + ][i + len - ][y] && !vis[dp[j + ][i + len - ][y] + dp[i][j][x]])

                            {

                                vis[dp[j + ][i + len - ][y] + dp[i][j][x]] = ;

                                dp[i][i + len - ].push_back(dp[j + ][i + len - ][y] + dp[i][j][x]);

                            }

                    for(int x = ; x < dp[i][i + len - ].size(); ++x)

                        vis[dp[i][i + len - ][x]] = ;

            }

        sort(dp[][n].begin(), dp[][n].end());

        printf("Case %d:", ++kase);

        for(int i = ; i < dp[][n].size(); ++i)

            printf(" %d", dp[][n][i]);

        puts("");

    }

    return ;

}