// 
//./D<test

#include <bits/stdc++.h>
#define endl '\\n'
#define cediv(a,b) ((a)%(b)==0?((a)/(b)):((a)/(b))+1)
#define fi first
#define se second
#define pb push_back

using namespace std;

typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;

template<typename T>
inline T umax(T &u, T v){return u = max(u, v);}
template<typename T>
inline T umin(T &u, T v){return u = min(u, v);}

double datas[1010];
double ans[1010];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int n,k;
    cin>>n>>k;
    for(int i=0; i<n; i++){
        cin>>datas[i];
    }
    ll up=n-k;
    ll down=n-1;
    double mul=(double)k/n;
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            ans[j]+=mul*datas[(n+j-i)%n];
        }
        mul*=(double)up/down;
        up--;
        down--;
        if(up==-1) break;
    }
    cout.precision(12);
    double sum=0;
    for(int i=0; i<n; i++) cout<<ans[i]<<' ';
    for(int i=0; i<n; i++) sum+=ans[i];
    
    cout<<endl;
    //cout<<sum<<endl;
    return 0;
}