#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int maxn = 3e6 + 5;
double p[maxn], f[maxn], res[maxn];
int main() {
  int n, k, tk = 0;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%lf", &p[i]);
    if (abs(p[i]) > 1e-6) tk++;
  }
  k = min(tk, k);
  f[0] = 1;
  for (int i = 1, up = 1 << n; i < up; i++) {
    double t = 1;
    int num = 0;
    for (int j = 0, sta = i; j < n; j++, sta >>= 1)
      if (sta & 1) t -= p[j], num++;
    if (num > k) continue;
    for (int j = 0, sta = i; j < n; j++, sta >>= 1)
      if (sta & 1) f[i] += p[j] / (t + p[j]) * f[i - (1 << j)];
  }
  for (int i = 1, up = 1 << n; i < up; i++) {
    int num = 0;
    for (int j = 0, sta = i; j < n; j++, sta >>= 1)
      if (sta & 1) num++;
    if (num != k) continue;
    for (int j = 0, sta = i; j < n; j++, sta >>= 1)
      if (sta & 1) res[j] += f[i];
  }
  for (int i = 0; i < n; i++) printf("%.10lf ", res[i]);
}
