/*
 * author:  ADMathNoob
 * created: 05/17/24 20:37:57
 * problem: https://qoj.ac/problem/5646
 */

/*
Comments about problem:


*/

#include <bits/stdc++.h>

using namespace std;

#ifdef _DEBUG
#include "debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  // prob that i gets to n from doing the t-th fusion
  vector<vector<double>> prob(m, vector<double>(n));
  for (int i = 0; i < m; i++) {
    int s;
    cin >> s;
    --s;
    vector<vector<double>> dp(n, vector<double>(n));
    dp[0][s] = 1;
    for (int t = 0; t < n - 1; t++) {
      for (int x = 0; x < n - 1; x++) {
        double p = 1.0 / (n - 1 - x);
        for (int y = x + 1; y < n; y++) {
          dp[t + 1][y] += dp[t][x] * p;
        }
      }
    }
    for (int t = 0; t < n; t++) {
      prob[i][t] = dp[t][n - 1];
    }
  }
  vector<vector<double>> suf(m, vector<double>(n + 1));
  for (int i = 0; i < m; i++) {
    for (int t = n - 1; t >= 0; t--) {
      suf[i][t] = suf[i][t + 1] + prob[i][t];
    }
    assert(abs(suf[i][0] - 1.0) < 1e-8);
  }
  for (int i = 0; i < m; i++) {
    double ret = 0;
    for (int w = 0; w < n; w++) {
      double others = 1.0;
      for (int j = 0; j < m; j++) {
        if (j == i) {
          continue;
        }
        others *= suf[j][w];
      }
      ret += prob[i][w] * others;
    }
    cout.precision(10);
    cout << fixed;
    cout << ret << " \n"[i == m - 1];
  }
  return 0;
}