#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(...) (__VA_ARGS__)
#define debugv(x)
#define cerr if(0)cout
#endif
#define next ____next
#define prev ____prev
#define left ____left
#define hash ____hash
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
template<class T> void ResizeVec(T&, vector<int>) {}
template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
  vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
  for (T& v : vec) { ResizeVec(v, sz); }
}
typedef Triple<int, int, int> TIII;
template<class A, class B, class C>
ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }

const LD kPi = 2 * acos(0);
LD Sq(LD x) {
  return x * x;
}
struct Point {
  LD x, y;
  Point operator+(Point p) {
    return {x + p.x, y + p.y};
  }
  Point operator-(Point p) {
    return {x - p.x, y - p.y};
  }
  Point operator*(LD f) {
    return {x * f, y * f};
  }
  Point operator/(LD f) {
    return {x / f, y / f};
  }
  void RotateSelf(LD angle) {
    LD c = cos(angle); LD s = sin(angle);
    LD nx = x * c - y * s; LD ny = y * c + x * s;
    y = ny; x = nx;
  }
  friend ostream& operator<<(ostream& out, Point m);
};

ostream& operator<<(ostream& out, Point p) {
  out << "(" << p.x << ", " << p.y << ")"; return out;
}


LD Dis(Point P, Point Q) {
  P = P - Q;
  return sqrt(Sq(P.x) + Sq(P.y));
}

const int N = 6e3 + 5;
LD ang[N];
Point pt[N];
LD half[N];
Point sum_halves[N];

int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int n, L;
  cin>>n>>L;
  sum_halves[0] = {(LD)0, (LD)0};
  RE (i, n) {
    int t;
    cin>>t;
    ang[i] = 2 * kPi * t / L;
    ang[i + n] = ang[i] + 2 * kPi;
    //ang[i + 2 * n] = ang[i] + 4 * kPi;
  }
  RE (i, 2 * n) {
    pt[i] = Point{cos(ang[i]), sin(ang[i])};
    debug(pt[i].x, pt[i].y);
    half[i] = ang[i] / 2;
    sum_halves[i] = sum_halves[i - 1] + Point{cos(half[i]), sin(half[i])};
  }
  Point sum{0, 0};
  RE (i, n) {
    FOR (j, i + 1, i + n - 1) {
      LD ang_mid = (ang[i] + ang[j]) / 2;
      Point mid = Point{cos(ang_mid), sin(ang_mid)};
      LD r = Dis(mid, pt[i]);
      int len = i + n - 1 - j;
      Point sum_intv = sum_halves[i + n - 1] - sum_halves[j];
      LD gamma = ang_mid + kPi;
      sum_intv.RotateSelf(gamma / 2);
      //debug(sum_intv, mid);
      debug(sum_intv * r + mid * len);
      sum = sum + sum_intv * r + mid * len;
    }
  }
  debug(sum);
  LD mult = 2. / (n * (n - 1) * (n - 2));
  debug(mult);
  cout<<sum.x * mult<<" "<<sum.y * mult<<endl;
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}


Measured memory_bytes: 896