#include <bits/stdc++.h>
using namespace std;
long long n, k, fac[23], num[25], ans[25], ncr(long long, long long);
double func(long long), ar[25], dp[(1 << 20)];
int main() {
  cin >> n >> k;
  fac[0] = 1;
  for (int i = 1; i < 21; i++) {
    fac[i] = (fac[i - 1] * i);
  }
  for (int i = k - 1; i >= 0; i--) {
    num[i] = ncr((n - 1), i);
    long long tot = 0;
    for (int j = i + 1; j <= k - 1; j++) {
      tot += ncr((n - 1) - i, j - i) * ans[j];
    }
    ans[i] = 1 - tot;
  }
  for (int i = 0; i < n; i++) scanf("%lf", &ar[i]);
  for (int i = 0; i < (1 << 20); i++) dp[i] = -1;
  for (int i = 0; i < n; i++) {
    double a = 0;
    for (int j = 0; j < (1 << n); j++) {
      long long x = __builtin_popcount(j);
      if (x <= k - 1 && (j & (1 << i)) == 0) {
        a += func(j) * ans[x];
      }
    }
    printf("%0.18lf ", a * ar[i]);
  }
}
double func(long long mask) {
  if (dp[mask] >= 0) return dp[mask];
  double ans = 0;
  for (int i = 0; i < n; i++) {
    if ((1 << i) & mask) ans += ar[i];
  }
  if (ans == 1) return 1000;
  return dp[mask] = (1 / (1 - ans));
}
long long ncr(long long n, long long d) {
  return (fac[n] / fac[d]) / fac[n - d];
}
