#include <bits/stdc++.h>
using namespace std;
const int maxn = (1LL << 20) + 6;
double dp[maxn];
int n, k;
double res[maxn];
double p[21], sum[maxn];
int main() {
  cin >> n >> k;
  dp[0] = 1;
  int t = 0;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    if (!p[i]) {
      t++;
    }
  }
  k = min(k, n - t);
  for (int i = 0; i < (1LL << n); i++)
    for (int ind = 0; ind < n; ind++)
      if (((i >> ind) & 1) == 0) sum[i] += p[ind];
  for (int i = 1; i <= n; i++)
    for (int ind = 0; ind < (1LL << n); ind++) {
      if (__builtin_popcount(ind) != i) continue;
      for (int j = 0; j < n; j++)
        if (ind & (1LL << j))
          dp[ind] += (dp[ind ^ (1LL << j)] * p[j]) / (sum[ind] + p[j]);
    }
  cout << fixed << setprecision(7);
  for (int i = 0; i < n; i++) {
    if (!p[i]) {
      cout << 0 << " ";
      continue;
    }
    double ans = 0;
    for (int j = 0; j < (1LL << n); j++)
      if (__builtin_popcount(j) == k && (j & (1LL << i))) ans += dp[j];
    cout << ans << " ";
  }
}
