#include <bits/stdc++.h>
using namespace std;
int n, k;
double ans[1 << 21], f[1 << 21], p[21];
int main() {
  scanf("%d%d", &n, &k);
  int c = 0;
  for (int i = 0; i < n; i++) {
    scanf("%lf", &p[i]);
    if (p[i] != 0) c++;
  }
  k = min(k, c);
  f[0] = 1;
  for (int i = 0; i < (1 << n); i++) {
    double cnt = 0, now = 0;
    for (int j = 0; j < n; j++)
      if ((i >> j) & 1) cnt++, now += p[j];
    if (cnt == k) {
      for (int j = 0; j < n; j++)
        if ((i >> j) & 1) ans[j] += f[i];
      continue;
    }
    if (cnt > k) continue;
    if (1.0 - now == 0) continue;
    f[i] /= (1.0 - now);
    for (int j = 0; j < n; j++)
      if (!((i >> j) & 1)) f[i | (1 << j)] += f[i] * p[j];
  }
  for (int i = 0; i < n; i++) printf("%.12lf%c", ans[i], " \n"[i == n - 1]);
  return 0;
}
