#include <bits/stdc++.h>
using namespace std;
int n, k;
double a[30];
double dp[1048587], sum[1048587];
double ans[30];
double solve(int i) {
  if (dp[i] != -1) return dp[i];
  double ret = 0;
  for (int j = 0; j < n; j++)
    if ((i >> j) & 1) {
      double sl = solve(i ^ (1 << j));
      ret += sl * a[j] / sum[i ^ (1 << j)];
    }
  return dp[i] = ret;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  int zeroc = 0;
  for (int i = 0; i < n; i++)
    if (a[i] == 0) zeroc++;
  k = min(k, n - zeroc);
  for (int i = 0; i < (1 << n); i++) dp[i] = -1;
  dp[0] = 1;
  for (int i = 0; i < (1 << n); i++) {
    sum[i] = 1;
    for (int j = 0; j < n; j++)
      if ((i >> j) & 1) sum[i] -= a[j];
  }
  for (int i = 0; i < (1 << n); i++)
    if (sum[i] == 0) sum[i] = 1;
  for (int i = 0; i < n; i++) ans[i] = 0;
  for (int i = 0; i < (1 << n); i++) {
    if (__builtin_popcount(i) == k) {
      for (int j = 0; j < n; j++)
        if (!((i >> j) & 1)) {
          ans[j] += solve(i);
        }
    }
  }
  cout << fixed << setprecision(16);
  for (int i = 0; i < n; i++) cout << 1 - ans[i] << ' ';
}
