#include <bits/stdc++.h>
using namespace std;
double f[1 << 20 | 1], p[30], s[1 << 20 | 1], ans[30];
int n, k, m;
int cnt[1 << 20 | 1], bin[30];
void init() {
  for (int i = 0; i < bin[n]; i++)
    for (int j = 0; j < n; j++)
      if ((i & bin[j]) != 0) {
        ++cnt[i];
        s[i] += p[j + 1];
      }
}
int main() {
  scanf("%d%d", &n, &k);
  m = n;
  bin[0] = 1;
  for (int i = 1; i <= n; i++) {
    bin[i] = bin[i - 1] << 1;
    scanf("%lf", &p[i]);
    if (p[i] < 1e-12) --m;
  }
  k = min(m, k);
  init();
  f[0] = 1.0;
  for (int i = 0; i < bin[n]; i++) {
    if (cnt[i] == k) {
      for (int j = 1; j <= n; j++)
        if ((i & bin[j - 1]) != 0) ans[j] += f[i];
    }
    for (int j = 1; j <= n; j++)
      if ((i & bin[j - 1]) == 0) f[i | bin[j - 1]] += f[i] * p[j] / (1 - s[i]);
  }
  for (int i = 1; i <= n; i++) {
    printf("%.12lf", ans[i]);
    if (i != n) printf(" ");
  }
}
