#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#define maxn 100005

#define out1(a) cout<<#a<<" "<<a<<endl
#define out2(a,b) cout<<#a<<" "<<a<<" "<<#b<<" "<<b<<endl
#define out3(a,b,c) cout<<#a<<" "<<a<<" "<<#b<<" "<<b<<" "<<#c<<" "<<c<<endl

#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define fori(it,A) for(auto it=A.begin();it!=A.end();it++)

#define ft first
#define sd second
#define pb push_back
#define mp make_pair
#define pq priority_queue
#define all(x) (x).begin(),(x).end()
#define zero(x) memset(x,0,sizeof(x));
#define ceil(a,b) (a+b-1)/b
 
using namespace std;

int binpow(int a, int b) {
    int res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

//START OF CODE ->->->->->->->

void solve()
{
    int n,k;
    cin>>n>>k;
    while(k){
        if ( n % 200 == 0 ){
            n /= 200;
            k--;
        }
        else{
            if ( k >= 2 ){
                n *= 5;
                n++;
                k -= 2;
            }
            else{
                n *= 5;
                n++;
                n *= 200;
                k--;
            }
        }
    }

    cout<<n<<endl;
}

//END OF CODE ->->->->->->->->

signed main()
{
    fast;
    int t = 1;
    // cin>>t;
    for ( int i = 1 ; i <= t ; i++ ){
        // cout<<"Case #"<<i<<": ";
        solve();
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define FIO     ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define endl "\n"
#define pb push_back
#define mp make_pair
#define re(i,n)        for(int i=0;i<(n);i++)
#define re1(i, k, n) for (int i = k; k < n ? i <= n : i >= n; k < n ? i += 1 : i -= 1)
#define FORD(i,a,b)     for(int i=(a);i>=(b);i--)
typedef pair<int, int> pii;
typedef priority_queue<pii, vector<pii>, greater<pii>> minpq;
typedef priority_queue<pii> maxpq;
#define mod 1000000007
//===================================DEBUG TEMPLATE=================================================
void __print(int x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V>
void __print(const pair<T, V> &x)
{
	cerr << '{';
	__print(x.first);
	cerr << ',';
	__print(x.second);
	cerr << '}';
}
template <typename T>
void __print(const T &x)
{
	int f = 0;
	cerr << '{';
	for (auto &i : x)
		cerr << (f++ ? "," : ""), __print(i);
	cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
	__print(t);
	if (sizeof...(v))
		cerr << ", ";
	_print(v...);
}
//====================================DEBUG TEMPLATE==============================================

int k, n, m;
vi a, l, r;

bool check(int x) {
	int ls = 0, rs = 0;
	re(i, k) {
		l[i] = max(0ll, (m * a[i] - x + n - 1) / n);
		ls += l[i];
	}
	re(i, k) {
		r[i] = (m * a[i] + x) / n;
		rs += r[i];
	}
	return ((ls <= m) && (m <= rs));
}

vector<int> mak(int x) {
	vi b(k);
	int bs = 0;
	re(i, k) {
		b[i] = max(0ll, (m * a[i] - x + n - 1) / n);
		bs += b[i];
	}
	re(i, k) {
		r[i] = (m * a[i] + x) / n;
	}
	re(i, k) {
		int x = min(m - bs, r[i] - b[i]);
		b[i] += x;
		bs += x;
	}
	return b;
}

void solve() {
	cin >> k >> n >> m;
	a.resize(k);
	l.resize(k);
	r.resize(k);
	re(i, k) {
		cin >> a[i];
	}
	int l = 0, r = n * m;
	while (l + 1 < r) {
		int x = (l + r) / 2;
		if (check(x))
			r = x;
		else
			l = x;
	}
	vi ans = mak(r);
	re(i, k) {
		cout << ans[i] << " ";
	}
}

int32_t main()
{
	FIO;
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin) ;
	freopen("output.txt", "w", stdout) ;
#endif

	int t = 1;
	while (t--) {
		solve();
	}

	return 0;
}