#include <bits/stdc++.h>
using namespace std;
const int N = 20 + 1;
long double dp[1 << N], p[N], ans[N];
int n, k, zero;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    if (p[i] == 0) zero++;
  }
  dp[0] = 1;
  for (int mask = 1; mask < (1 << n); mask++) {
    long double sum = 0;
    for (int i = 0; i < n; i++)
      if (mask & (1 << i)) sum += p[i];
    for (int i = 0; i < n; i++)
      if (mask & (1 << i) && (1 - sum + p[i]) > 0)
        dp[mask] += dp[mask - (1 << i)] * p[i] / (1 - sum + p[i]);
  }
  for (int i = 0; i < n; i++)
    for (int mask = 0; mask < (1 << n); mask++)
      if ((mask & (1 << i)) && __builtin_popcount(mask) == min(n - zero, k))
        ans[i] += dp[mask];
  for (int i = 0; i < n; i++) cout << fixed << setprecision(6) << ans[i] << " ";
}
