#include <bits/stdc++.h>
using namespace std;
double dp[1050000];
int n, k;
double p[25];
double ans[25];
int main() {
  memset(dp, 0, sizeof(dp));
  memset(ans, 0, sizeof(ans));
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%lf", p + i);
  dp[0] = 1;
  int st = (1 << n);
  for (int i = 1; i < st; i++) {
    double sp = 0;
    int o = 0;
    for (int j = 0; j < n; j++) {
      if (i & 1 << j)
        o++;
      else
        sp += p[j];
    }
    if (o > k) continue;
    for (int j = 0; j < n; j++)
      if ((i & 1 << j) && p[j] > 0.000000001) {
        dp[i] += dp[i - (1 << j)] * p[j] / (sp + p[j]);
        ans[j] += dp[i - (1 << j)] * p[j] / (sp + p[j]);
      }
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
