#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int K, n, bin[25];
long double f[1048576], p[25], ans[25];
long double dp(int x) {
  if (x == 0) f[x] = 1;
  int cnt = 0;
  long double tot = 0;
  for (int i = 1; i <= n; i++)
    if ((bin[i - 1] & x) == 0)
      tot += p[i];
    else
      cnt++;
  if (cnt >= K) {
    if (cnt > K) return 0;
    for (int i = 1; i <= n; i++)
      if (x & bin[i - 1]) ans[i] += f[x];
    return f[x];
  }
  for (int i = 1; i <= n; i++)
    if ((bin[i - 1] & x) == 0) {
      int t = (bin[i - 1] | x);
      f[t] += f[x] * (p[i] / tot);
    }
  return f[x];
}
int main() {
  bin[0] = 1;
  for (int i = 1; i <= 20; i++) bin[i] = bin[i - 1] << 1;
  n = read();
  K = read();
  int m = n;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    if (p[i] <= 1e-10) m--;
  }
  K = min(K, m);
  for (int i = 0; i < bin[n]; i++) dp(i);
  for (int i = 1; i <= n; i++) printf("%.16lf ", (double)ans[i]);
  return 0;
}
