#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
long long cxk=1;
long long a[114514],n,w;
long long b[114514];
bool cmp(long long a,long long b)
{
	return a>b;
}
int main()
{
	//freopen("live.in","r",stdin);
	//freoepn("live.out","w",stdout);
	cin>>n>>w;
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
	b[1]=a[1];
	cout<<a[1]<<" ";
	for(int i=2;i<=n;i++)
	{
		int x=a[i];
		int j=i-1;
		while(j>0&&x>a[j])
		{
			a[j+1]=a[j];
			j=j-1;
		}
		a[j+1]=x; 
		long long jn=i*w/100;
		printf("%lld ",a[max(cxk,(jn))]);
	}
	return 0;
}

两个半月之前的代码了...