#include <bits/stdc++.h>
using namespace std;
const int N = 23;
int n, k, t;
long double dp[(1 << N) + 5];
long double p[N];
long double ans[N];
int main() {
  cout << fixed << setprecision(7);
  cin >> n >> k;
  t = n;
  for (int i = 0; i < n; i++) {
    cin >> p[i];
    if (p[i] == 0) {
      t--;
    }
  }
  k = min(k, t);
  dp[0] = 1;
  for (int mask = 0; mask < (1 << n); mask++) {
    long double sum = 0;
    for (int i = 0; i < n; i++) {
      if ((mask >> i) % 2) {
        sum += p[i];
      }
    }
    sum = 1 - sum;
    for (int i = 0; i < n; i++) {
      if ((mask >> i) % 2) {
        dp[mask] += dp[mask ^ (1 << i)] * p[i] / (p[i] + sum);
      }
    }
    if (__builtin_popcount(mask) == k) {
      for (int i = 0; i < n; i++) {
        if ((mask >> i) % 2) {
          ans[i] += dp[mask];
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << ' ';
  }
}
