#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7, mod1 = 1e9 + 9;
const int N = 21;
double dp[1 << N], dp2[1 << N], ans[N], ans2[N], p[N], eps = 1e-15;
int n, k;
double solve(int mask) {
  if (mask == 0) return 1;
  if (dp[mask] >= 0) return dp2[mask];
  double an = 0, tmp = 0;
  for (int i = 0; i < (n); i++) {
    if (mask & 1 << i && p[i] > 0) {
      an += p[i] * solve(mask ^ (1 << i));
      tmp += p[i];
    }
  }
  dp[mask] = an;
  if (tmp < 1) an /= 1 - tmp;
  return dp2[mask] = an;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  cout << fixed << setprecision(10);
  cin >> n >> k;
  int n2 = n;
  memset(dp, (-1), sizeof(dp));
  for (int i = 0; i < (n); i++) {
    cin >> p[i];
    if (abs(p[i]) < eps) n2--;
  }
  k = min(k, n2);
  for (int i = 0; i < (1 << n); i++) {
    if (__builtin_popcount(i) != k) continue;
    solve(i);
    double an = dp[i];
    for (int j = 0; j < (n); j++)
      if (i & 1 << j) {
        ans[j] += an;
      }
  }
  for (int i = 0; i < (n); i++) cout << ans[i] << ' ';
  return 0;
}
