#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
void bad(int mes) {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
mt19937_64 mt_rand(chrono::system_clock::now().time_since_epoch().count());
template <typename T1, typename T2>
inline bool upmax(T1& a, T2 b) {
  return (a < b ? (a = b, true) : false);
}
template <typename T1, typename T2>
inline bool upmin(T1& a, T2 b) {
  return (b < a ? (a = b, true) : false);
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)2e5 + 3, base = 998244353;
const long long llinf = 2e18 + 5;
int binpow(int a, int second) {
  int res = 1;
  while (second) {
    if (second % 2) {
      res = 1ll * res * a % base;
    }
    a = 1ll * a * a % base;
    second /= 2;
  }
  return res;
}
char g[21][21];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, l;
  cin >> n >> l;
  vector<int> t(n);
  for (int i = 0; i < n; i++) {
    cin >> t[i];
  }
  const long double PI = acosl(-1);
  long double ex = 0;
  long double ey = 0;
  int iter = 0;
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++)
      for (int k = j + 1; k < n; k++) {
        const long double C = 2. * PI / l;
        long double a = 2. * sin(0.5 * (t[k] - t[j]) * C);
        long double b = 2. * sin(0.5 * (l - t[k] + t[i]) * C);
        long double c = 2. * sin(0.5 * (t[j] - t[i]) * C);
        long double xi = cos(1. * t[i] * C);
        long double xj = cos(1. * t[j] * C);
        long double xk = cos(1. * t[k] * C);
        long double yi = sin(1. * t[i] * C);
        long double yj = sin(1. * t[j] * C);
        long double yk = sin(1. * t[k] * C);
        ex += (a * xi + b * xj + c * xk) / (a + b + c);
        ey += (a * yi + b * yj + c * yk) / (a + b + c);
        ++iter;
      }
  cout << fixed << setprecision(20) << (ex / iter) << ' ' << (ey / iter);
  return 0;
}
