Tribles UVA11021

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string>    
#include <sstream>
#include <utility>   
#include <ctime>

using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;
using std::endl;

const int MAXN(1010);

double prob[MAXN];
double table[MAXN];

int main()
{
	int T, n_case(0);
	scanf("%d", &T);
	while(T--)
	{
		int N, K, M;
		scanf("%d%d%d", &N, &K, &M);
		for(int i = 0; i < N; ++i)
			scanf("%lf", prob+i);
		table[1] = prob[0];
		for(int i = 2; i <= M; ++i)
		{
			double temp = table[i-1];
			table[i] = prob[0];
			for(int j = 1; j < N; ++j)
			{
				table[i] += prob[j]*temp;
				temp *= table[i-1];
			}
		}
		double ans = 1;
		for(int i = 1; i <= K; ++i)
			ans *= table[M];
		printf("Case #%d: %.7f\n", ++n_case, ans);
	}
	return 0;
}