#include <bits/stdc++.h>
double p[22], d[(1 << 20) + 10];
double ans[22];
int hmany(int a) {
  int ret = 0;
  while (a) {
    if (a % 2) ret++;
    a >>= 1;
  }
  return ret;
}
int n, k;
int main() {
  scanf("%d%d", &n, &k);
  int num = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &p[i]);
    if (p[i] == 0) num++;
  }
  if (n - num < k) k = n - num;
  memset(d, 0, sizeof(d));
  d[0] = 1.0;
  for (int i = 0; i < (1 << n); i++) {
    int tmp = i;
    double tmpp = 0.0;
    int tmpk = 0;
    for (int j = 1; j <= n; j++) {
      if (i & (1 << (j - 1))) {
        tmpk++;
      } else
        tmpp += p[j];
    }
    if (tmpk >= k) continue;
    for (int j = 1; j <= n; j++) {
      if (((1 << (j - 1)) & i) == 0) {
        d[i | (1 << (j - 1))] += d[i] * (p[j] / tmpp);
      }
    }
  }
  memset(ans, 0, sizeof(ans));
  for (int i = 0; i < (1 << n); i++) {
    if (hmany(i) != k) continue;
    for (int j = 1; j <= n; j++) {
      if ((1 << (j - 1)) & i) {
        ans[j] += d[i];
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%.10lf\n", ans[i]);
  }
  return 0;
}
