#include <bits/stdc++.h>
using namespace std;
const int maxn = 22;
double p[maxn];
double dp[1 << maxn];
double ans[maxn];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  int n, k;
  cin >> n >> k;
  for (int j = 0; j < n; ++j) {
    cin >> p[j];
  }
  dp[0] = 1;
  for (int j = 1; j < (1 << n); ++j) {
    double sp = 0;
    int num = 0;
    for (int l = 0; l < n; ++l) {
      if ((j & (1 << l)) == 0) {
        ++num;
        sp += p[l];
      }
    }
    if (n - num > k) continue;
    for (int l = 0; l < n; ++l) {
      if (p[l] > 0 && j & (1 << l)) {
        dp[j] += dp[j - (1 << l)] * (p[l] / (p[l] + sp));
        ans[l] += dp[j - (1 << l)] * (p[l] / (p[l] + sp));
      }
    }
  }
  for (int j = 0; j < n; ++j) cout << ans[j] << " ";
  cout << endl;
  return 0;
}
