#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<double> P, sol;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k;
  P = vector<double>(n);
  sol = vector<double>(n, 0.0);
  for (auto& p : P) cin >> p;
  int alive = 0;
  for (auto& p : P)
    if (p > 0.00001) ++alive;
  k = min(k, alive);
  map<int, double> dp[2];
  dp[0][0] = 1.0;
  for (int num = 0; num < k; ++num) {
    map<int, double>& cur = dp[num & 1];
    map<int, double>& next = dp[(num & 1) ^ 1];
    next.clear();
    for (auto const& knv : cur) {
      int choose = knv.first;
      double prob = knv.second;
      double rest = 1.0;
      for (int i = 0; i < n; ++i)
        if (choose & (1 << i)) rest -= P[i];
      for (int i = 0; i < n; ++i) {
        if ((choose & (1 << i)) == 0 && P[i] > 0.00001)
          next[(choose | (1 << i))] += (prob * P[i] / rest);
      }
    }
  }
  for (auto const& knv : dp[k & 1]) {
    int choose = knv.first;
    double prob = knv.second;
    for (int i = 0; i < n; ++i)
      if (choose & (1 << i)) sol[i] += prob;
  }
  cout << setprecision(15);
  for (auto& x : sol) cout << x << ' ';
}
