#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

const int maxn = 5e5 + 5;
int tr[maxn];

int lowbit(int x){
    return x & -x;
}

void modify(int x, int v){
    while(x < maxn){
        tr[x] += v;
        x += lowbit(x);
    }
}

int query(int x){
    int ans = 0;
    while(x){
        ans += tr[x];
        x -= lowbit(x);
    }
    return ans;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n; string str;
    cin >> n >> str;
    pair<LL, LL> k;
    auto pos = str.find('.');
    if (pos == string::npos){
        k = {stoll(str), 1};
    }
    else{
        int cnt = str.size() - pos - 1;
        str.erase(str.begin() + pos);
        k.second = 1;
        while(cnt--) k.second *= 10;
        k.first = stoll(str);
    }
    vector<int> p(n + 1);
    vector<vector<int> > g(n + 1);
    for(int i = 1; i <= n; i++){
        p[i] = __int128_t(i) * k.second / k.first;
        g[p[i]].push_back(i);
    }
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    a.push_back(0);
    sort(a.begin(), a.end());
    auto b = a;
    b.erase(unique(b.begin(), b.end()), b.end());
    const int m = b.size();

    vector<int> sz(n + 1);

    auto dfs = [&](auto &&dfs, int u) -> void {
        sz[u] = 1;
        for(auto j : g[u]){
            dfs(dfs, j);
            sz[u] += sz[j];
        }
    };

    dfs(dfs, 0);

    for(auto x : a){
        int id = lower_bound(b.begin(), b.end(), x) - b.begin() + 1;
        modify(id, 1);
    }

    modify(1, -(n + 1));
    vector<int> ans(n + 1);
    ans[0] = 1;

    for(int i = 1; i <= n; i++){
        modify(ans[p[i]], sz[i]);

        // 找到最大的x满足s[x, m] >= sz[i]
        // s[m] - s[x - 1] >= sz[i]
        // s[x - 1] <= s[m] - sz[i]

        int target = query(m) - sz[i];

        int x = 0, sum = 0;
        for(int j = 19; j >= 0; j--){
            if (x + (1 << j) <= m and sum + tr[x + (1 << j)] <= target){
                sum += tr[x + (1 << j)];
                x += 1 << j;
            }
        }
        x += 1;
        modify(x, -sz[i]);
        ans[i] = x;
        cout << b[x - 1] << " \n"[i == n];
    }

}