#include <bits/stdc++.h>
using namespace std;
const int N = 21, M = 1 << 20;
double ee[M], dp[M], e[N], ans[N];
int k, n;
const double eps = 1e-9;
int32_t main() {
  cout << fixed << setprecision(10);
  cin >> n >> k;
  int num = 0;
  for (int i = 0; i < n; i++) {
    cin >> e[i];
    if (abs(e[i] - 0) < eps) num++, e[i] = 0;
    dp[(1 << i)] = e[i], ee[(1 << i)] = e[i];
  }
  k = min(k, n - num);
  if (k == 1) {
    for (int i = 0; i < n; i++) cout << e[i] << ' ';
    return 0;
  }
  for (int ma = 0; ma < M; ma++) {
    int t = __builtin_popcount(ma);
    if (t >= k) continue;
    if (t != 1)
      for (int i = 0; i < n; i++) ee[ma] += ((ma >> i) & 1) * e[i];
    if (t != 1)
      for (int i = 0; i < n; i++) {
        if (e[i] == 0) continue;
        if ((1 << i) & ma) {
          dp[ma] += dp[ma - (1 << i)] * (e[i] / (1 - ee[ma - (1 << i)]));
        }
      }
    if (t == k - 1) {
      dp[ma] /= (1 - ee[ma]);
      for (int i = 0; i < n; i++) {
        if (e[i] == 0) continue;
        if (((1 << i) & ma) == 0) dp[ma + (1 << i)] += dp[ma] * e[i];
      }
    }
  }
  for (int ma = 0; ma < M; ma++)
    if (__builtin_popcount(ma) == k)
      for (int i = 0; i < n; i++)
        if (e[i] == 0)
          continue;
        else if ((1 << i) & ma)
          ans[i] += dp[ma];
  for (int i = 0; i < n; i++) cout << ans[i] << ' ';
}
