132.cpp

#include <iostream>
#include <sstream>
#include <ios>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cctype>
using namespace std;
#define XINF INT_MAX
#define INF 0x3FFFFFFF
#define MP(X,Y) make_pair(X,Y)
#define PB(X) push_back(X)
#define REP(X,N) for(int X=0;X<N;X++)
#define REP2(X,L,R) for(int X=L;X<=R;X++)
#define DEP(X,R,L) for(int X=R;X>=L;X--)
#define CLR(A,X) memset(A,X,sizeof(A))
#define IT iterator
typedef long long ll;
typedef pair<int,int> PII;
typedef vector<PII> VII;
typedef vector<int> VI;

int main()
{
	ios::sync_with_stdio(false);


    string str;
    int cse = 1;
    while(getline(cin,str,'\n'))
    {

        int len = str.length();
        vector<int> ans;
        ans.clear();
        for(int i=0;i<len;i++)
        {
            int flag = 0;
            int num = 0;
            while( isdigit(str[i]))
            {
                flag =1;
                num = num*10 + str[i]-'0';
                i++;
            }
            if(flag)
            ans.push_back(num);
        }

        cout<<"Case "<<cse++<<": ("<<ans.size()<<") ";
        if(ans.size()>0)
        {

        for(int i=0;i<ans.size()-1;i++)
        {
            cout<<ans[i]<<" ";
        }
        cout<<ans[ans.size()-1]<<endl;
        }
        else
            cout<<endl;
    }



	return 0;
}