#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <sstream>
#include <fstream>

using namespace std;

int main()
{
	int K,n,h,i,j,k,c;
	int s[101],tmp[101];
	int sc[11]={40,37,33,30,27,23,20,17,13,10,0};

	ifstream fin("studies.in");

	fin>>K;
	for(int testcase=0;testcase<K;++testcase)
	{
		fin>>n>>h;
		memset(s,-1,sizeof(s)); memset(tmp,-1,sizeof(tmp)); 
		s[0]=0;
		for(i=0;i<n;++i)
		{
			for(j=0;j<11;++j) 
			{
				if(j<10) fin>>c; else c=0;
				for(k=0;k<=h;++k)
					if(s[k]>=0 && k+c<=h && (tmp[k+c]<s[k]+sc[j]))
					{
						tmp[k+c]=s[k]+sc[j];
					}
			}
			memcpy(s,tmp,sizeof(tmp));
		}
		printf("Data Set %d:\n%0.2f\n",testcase+1,(*max_element(s,s+h+1))/10.0/n);
	}

	return 0;
}