#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("-ffloat-store")
using namespace std;
const auto start_time = std::chrono::high_resolution_clock::now();
void aryanc403() {}
const long long int INF = 0xFFFFFFFFFFFFFFFL;
long long int seed;
mt19937 rng(seed = chrono::steady_clock::now().time_since_epoch().count());
inline long long int rnd(long long int l = 0, long long int r = INF) {
  return uniform_int_distribution<long long int>(l, r)(rng);
}
class CMP {
 public:
  bool operator()(pair<long long int, long long int> a,
                  pair<long long int, long long int> b) {
    return !(a.first < b.first || (a.first == b.first && a.second <= b.second));
  }
};
void add(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt == m.end())
    m.insert({x, cnt});
  else
    jt->second += cnt;
}
void del(map<long long int, long long int> &m, long long int x,
         long long int cnt = 1) {
  auto jt = m.find(x);
  if (jt->second <= cnt)
    m.erase(jt);
  else
    jt->second -= cnt;
}
bool cmp(const pair<long long int, long long int> &a,
         const pair<long long int, long long int> &b) {
  return a.first < b.first || (a.first == b.first && a.second < b.second);
}
const long long int mod = 1000000007L;
long long int T, n, i, j, k, in, cnt, l, r, u, v, x, y;
long long int m;
string s;
vector<long double> a, ans;
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << std::fixed << std::setprecision(10);
  {
    cin >> n >> k;
    a.resize(n);
    ans.resize(n);
    for (auto &x : a) cin >> x;
    vector<long long int> msks(1 << n);
    vector<long double> dp(1 << n);
    dp[0] = 1;
    iota(begin(msks), end(msks), 0);
    sort(begin(msks), end(msks),
         [&](const long long int x, const long long int y) {
           return __builtin_popcount(x) < __builtin_popcount(y);
         });
    ;
    ;
    for (auto msk : msks) {
      auto p = dp[msk];
      if (__builtin_popcount(msk) == k) {
        for (long long int j = 0; j < n; ++j) {
          if (msk & (1 << j)) ans[j] += p;
        }
        continue;
      }
      long double sum = 0;
      for (long long int j = 0; j < n; ++j) {
        if (msk & (1 << j)) sum += a[j];
      }
      if (abs(1 - sum) < 1e-9) {
        for (long long int j = 0; j < n; ++j) {
          if (msk & (1 << j)) ans[j] += p;
        }
        continue;
      }
      p *= 1 / (1 - sum);
      for (long long int j = 0; j < n; ++j) {
        if (msk & (1 << j)) continue;
        dp[msk | (1 << j)] += p * a[j];
      }
    }
    for (i = 0; i < (n); ++i) cout << ans[i] << " ";
  }
  aryanc403();
  return 0;
}
