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