#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"

const int inf=1e9+6;
const int maxn=8;
double gai[maxn];
int temp[maxn];
const int P[]={1,100,10000,1000000,100000000};

int n,k;

void bfs(int x){
	map<int ,double>m;
	m[x]=100.0;
	queue<int>q;
	while(!q.empty()){
		int u=q.front();
		q.pop();
		double pp=m[u];
		int tot=0,tmp=u;
		for(int i=n;i>0;i--){
			temp[i]=tmp%100;
			tmp/=100;
			tot+=temp[i];
		}
		if(tot==k){
			int win[maxn]={0};
			int maxx=temp[1];
			int xuan=0;
			win[xuan++]=1;
			for(int i=2;i<=n;i++){
				if(maxx==temp[i]){
					win[xuan++]=i;
				}else if(temp[i]>maxx){
					maxx=temp[i];
					xuan=0;
					win[xuan++]=i;
				}
			}
			for(int i=0;i<xuan;i++){
				gai[win[i]]+=pp/(double)xuan;
			}
		}else{
			for(int i=n;i>=1;i--){
				int v=u+P[n-i];
				double c=(double)temp[i]/(double)tot;
				auto it=m.find(v);
				if(it==m.end()){
					m[v]=pp*c;
					q.push(v);
				}else{
					it->second+=pp*c;
				}
			}
		}
	}
}

signed main(){
	while(cin>>n>>k){
		int u=0;
		for(int i=0;i<n;i++){
			int t;
			cin>>t;
			u*=100;
			u+=t;
		}
		bfs(u);
		for(int i=1;i<=n;i++){
			printf("pub %d: %.2f %%\n",i,gai[i]);
		}
	}
	
}