#include <bits/stdc++.h>
using namespace std;
double dp[(1 << 20) + 10];
double prob[25];
double ans[25];
int cntbits(int n) {
  int msk = 1;
  int cnt = 0;
  while (n) {
    if (n & msk) cnt++;
    n >>= 1;
  }
  return cnt;
}
int setbit(int n, int i) { return (n | (1 << i)); }
bool isset(int n, int i) { return (n & (1 << i)); }
void init() {
  for (int(i) = (0); (i) <= (24); (i)++) ans[i] = 0.0;
  dp[0] = 1.0;
  for (int(i) = (1); (i) <= ((1 << 20)); (i)++) dp[i] = 0.0;
}
void solve(int n, int k) {
  for (int(i) = (0); (i) <= (((1 << n) - 1)); (i)++) {
    if (cntbits(i) == k) {
      for (int(j) = (0); (j) <= ((n - 1)); (j)++) {
        if (isset(i, j)) {
          ans[j + 1] += dp[i];
        }
      }
    } else if (cntbits(i) < k) {
      double cancome = 0.0;
      for (int(j) = (0); (j) <= ((n - 1)); (j)++) {
        if (!isset(i, j)) {
          cancome += prob[j + 1];
        }
      }
      for (int(j) = (0); (j) <= ((n - 1)); (j)++) {
        if (!isset(i, j)) {
          int nxt = setbit(i, j);
          dp[nxt] += dp[i] * (prob[j + 1] / cancome);
        }
      }
    }
  }
}
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  int hasprob = 0;
  for (int(i) = (1); (i) <= (n); (i)++) {
    scanf("%lf", &prob[i]);
    if (prob[i] > 0.0000000001) hasprob++;
  }
  if (hasprob <= k) {
    for (int(i) = (1); (i) <= (n); (i)++) {
      if (prob[i] > 0.0000000001)
        printf("1.0 ");
      else {
        printf("0.0 ");
      }
    }
    printf("\n");
    return 0;
  }
  init();
  solve(n, k);
  for (int(i) = (1); (i) <= (n); (i)++) {
    printf("%.8lf ", ans[i]);
  }
  printf("\n");
  return 0;
}
