#include "bits/stdc++.h" using namespace std; #define ALL(x) begin(x), end(x) #define rep(i, n) for (int i = 0; i < (n); i++) #define mod 1000000007 using ll = long long; const int INF = 1000000000; const ll LINF = 1001002003004005006ll; int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1}; // ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; } struct IOSetup { IOSetup() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(12); } } iosetup; template ostream &operator<<(ostream &os, const vector &v) { for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 == (int)v.size() ? "" : " "); return os; } template istream &operator>>(istream &is, vector &v) { for (T &x : v) is >> x; return is; } double pi = acos(-1); signed main() { ll N, L; cin >> N >> L; vector T(N); cin >> T; for(int i = 0; i < N; i++) T.push_back(T[i] + L); vector sins(T.size() + 1), coss(T.size() + 1); sins[0] = 0.0, coss[0] = 0.0; rep(i, (int)T.size()){ sins[i + 1] = sins[i] + sin(2.0 * pi * T[i] / L); coss[i + 1] = coss[i] + cos(2.0 * pi * T[i] / L); } double cos_ = 0, sin_ = 0; for(int i = 1; i < N; i++){ sin_ += sin(2.0 * pi * T[i] / L) * (N - 1 - i); cos_ += cos(2.0 * pi * T[i] / L) * (N - 1 - i); } double res = 0; for(int i = 0; i < N; i++){ res += 0.5 * cos(2.0 * pi * T[i] / L) * sin_; res -= 0.5 * sin(2.0 * pi * T[i] / L) * cos_; sin_ -= sin(2.0 * pi * T[i + 1] / L) * (N - 2); sin_ += sins[N + i] - sins[i + 2]; cos_ -= cos(2.0 * pi * T[i + 1] / L) * (N - 2); cos_ += coss[N + i] - coss[i + 2]; } double den = double(N) * (N - 1) * (N - 2) / 6.0; cout << res / den << endl; return 0; }