#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define N 100010

int f(int x) {
	return 10 * ceil(sqrt(x));
}

int n, k;
int arr[N];

int main() {
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", arr + i);
	}
	for (int i = 1; i <= n; ++i) {
		int cnt = k;
		while(cnt > 0 && arr[i] != 100) {
			arr[i] = f(arr[i]);
			cnt--;
		}
	}
	for (int i = 1; i <= n; ++i) {
		printf("%d%c", arr[i], " \n"[i == n]);
	}
 	return 0;
}