#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (1); i <= (b); i++) {
    multiply *= a;
  }
  return multiply;
}
inline long long ABS(long long a) { return (a >= 0) ? a : -a; }
int n, k;
double ans[22], dp[1 << 20], p[22];
int main() {
  scanf("%d %d", &n, &k);
  int num = 0;
  for (int i = (0); i <= (n - 1); i++) {
    scanf("%lf", &p[i]);
    if (p[i] == 0) num++;
  }
  for (int i = (0); i <= (n - 1); i++) ans[i] = 0.0;
  for (int i = (0); i <= ((1 << n) - 1); i++) dp[i] = 0;
  dp[0] = 1;
  if (k >= n - num) {
    for (int i = (0); i <= (n - 1); i++) {
      if (p[i] > 0)
        ans[i] = 1;
      else
        ans[i] = 0;
    }
  } else
    for (int i = (0); i <= ((1 << n) - 1); i++) {
      if (__builtin_popcount(i) > k) continue;
      if (__builtin_popcount(i) == k) {
        for (int j = (0); j <= (n - 1); j++) {
          if (getbit(i, j)) ans[j] += dp[i];
        }
        continue;
      }
      double div = 0;
      for (int j = (0); j <= (n - 1); j++) {
        if (!getbit(i, j)) div += p[j];
      }
      for (int j = (0); j <= (n - 1); j++) {
        if (!getbit(i, j)) dp[setbit(i, j)] += dp[i] * p[j] / div;
      }
    }
  for (int i = (0); i <= (n - 1); i++) printf("%.12f ", ans[i]);
  putchar('\n');
  return 0;
}
