#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<functional>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#include<map>
using namespace std;
#define MOD 1000000007
#define f(i,n) for(int i=0;i<int(n);i++)
#define N 200000
#define pi 3.1415926535898


int main() {
	long double a[N];
	long double k;
	int n;
	long double x, y, z;
	long double xx, yy;
	int s, ans;
	bool v = true;
	ans = 0;
	scanf("%d %Lf", &n, &k);
	f(i, n) {
		scanf("%Lf", &a[i]);
	}
	xx = 0;
	yy = 0;
	f(i, n) {
		f(j, i) {
			x = (a[i] + a[j]) / 2;
			x = x / k;
			x = x * 2 * pi;
			y = (long double)(i - j - 1);
			y = (2 * y) + 2;
			y = ((long double)(n)) - y;
			z = cos(x);
			xx += (y*z);
			z = sin(x);
			yy += (y*z);		
		}
	}
	z = (long double)(n);
	xx = xx / z;
	yy = yy / z;
	z = z - 1.0;
	xx = xx / z;
	yy = yy / z;
	z = z - 1.0;
	xx = xx / z;
	yy = yy / z;
	xx = xx * 6.0;
	yy = yy * 6.0;

	printf("%.12Lf %.12Lf\n", xx, yy);


	return 0;
}