#include <iostream>
#include <algorithm> 
using namespace std;

bool cmp(int a, int b) {
    return a > b;
}

int main() {
    int n;
    double w; 
    cin >> n >> w;
    int a[n] = {0};
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int p = 1, line = a[0];
    for (int i = 0; i < n; i++) {
        sort(a, a + i, cmp); 
        cout << a[max(1, static_cast<int>((p + i) * w * 0.01))-1] << " "; 
        
    }
    return 0;
}