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

using namespace std;

double s[110][110];
double w[110][110];
void gentest();

bool noblock(int r1,int c1,int r2,int c2)
{
	int dt=(r2>r1)?1:-1;
	for(int i=r1;i!=r2;i+=dt)
	{
		if(i==r1) continue;
		double p= (double)(c1*(r2-i)+c2*(i-r1))/(r2-r1);
		if ((w[i][(int) (p)] > 1e-9 || s[i][(int) (p)] > 1e-9) && 
		    (w[i][(int)(p)] >= p - floor(p))) return false;
		if ((w[i][(int) (p+1)] > 1e-9 || s[i][(int) (p+1)] > 1e-9) && 
		    (w[i][(int)(p+1)] >= floor(p+1) - p)) return false;
	}
	return true;

}


int main()
{
	int K,d,i,j,k,l;
	double E,E2;
	ifstream fin("seating.in");
	fin>>K;
	for(int testcase=0;testcase<K;++testcase)
	{
		fin>>d>>E;
		E2=E*E;
		for(i=0;i<d;++i)
			for(j=0;j<d;++j)
				fin>>s[i][j]>>w[i][j];

		double maxsum=0;
		for(i=0;i<d;++i)
			for(j=0;j<d;++j)
			if(s[i][j]<1e-9 && w[i][j] < 1e-9)
			{
				double sum=0;
				for(k=0;k<i;++k)
					for(l=0;l<d;++l)
						if( s[k][l]>1e-9 && (k-i)*(k-i)+(l-j)*(l-j) < E2 && noblock(i,j,k,l) )
						{
							sum+=s[k][l]*(1- sqrt((double)(k-i)*(k-i)+(l-j)*(l-j))/E);
						}
				if(sum>maxsum) maxsum=sum;
			}
		printf("Data Set %d:\n%0.2f\n",testcase+1,maxsum);
	}

	return 0;
}