#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define pb push_back
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

int n, k, base, num[6];

double ans[6];

void dfs(int pos, int rem, int vote, double p) {
    //printf("%d %d %d %.2lf\n", pos, rem, vote, p); fflush(stdout);
    if (pos > n) {
        if (rem) return;
        vector<int> winner;
        winner.eb(1);
        rep(i, 2, n) {
            if (num[i] > num[winner[0]]) {
                winner.clear();
                winner.eb(i);
            } else if (num[i] == num[winner[0]]) winner.eb(i);
        }
        for (auto x : winner) ans[x] += p / winner.size();
        return;
    }
    int ori = num[pos];
    rep(i, 0, rem) {
        dfs(pos + 1, rem - i, vote, p);
        p = p * num[pos] / (i + 1) * (vote - base + 1) / vote;
        ++num[pos]; ++vote;
    }
    num[pos] = ori;
}

inline void work() {
    vector<int> s;
    base = 0;
    rep(i, 1, n) {
        ans[i] = 0;
        cin >> num[i];
        k -= num[i];
        base += num[i];
    }
    dfs(1, k, base, 1.0);
    rep(i, 1, n) printf("pub %d: %.2lf \%\n", i, ans[i] * 100);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    while (cin >> n >> k) work();
    return 0;
}