#include<bits/stdc++.h>
using namespace std ;
#define MOD 1e9 + 7
#define inf 1e18 + 1
#define int long long
#define LMAX LLONG_MAX
#define IMAX INT_MAX
#define LMIN LLONG_MIN
#define IMIN INT_MIN
#define sort_1(a) sort(a.begin(),a.end())
#define sort_2(a) sort(a.begin(),a.end(),greater<int>())
#define DEBUG_1(v,a) for(int i=0;i<a;i++) cout<<v[i]<<' ';
#define DEBUG_2(v,a) for(int i=a;i>=0;i--) cout<<v[i]<<' ';

void pranav()
{
	string n;
	int k;
	cin >> n >> k;
	int flg=0;
    int tmp = stoi(n) ;
	while(k--)
	{
		if(flg==1 || tmp%200==0)
		{
			tmp = tmp/200;
			n = to_string(tmp);
			if(tmp%200==0)
			 flg=1;
			else
			 flg=0;
		}
		else
		{
            tmp = tmp*1000 + 200; 
			n.push_back('2');
			n.push_back('0');
			n.push_back('0');
			flg=1;
		}
	}
	cout << n << endl;
}

signed main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int t=1;
	//cin >> t;

	while(t--)
	{
	   pranav();
	}
	return 0;
}
#include<iostream> 
#include<iomanip>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ull unsigned long long
ull n,m,k;
int a[75];
int main()
{
	scanf("%lld%lld",&n,&k);
	while(k)
	{
		if(n%200==0)n/=200,k--;
		else
		{
			if(k>=2) 
			{
				n=n*5+1;
				k-=2;
			}
			else
			{
				n=n*1000+200;
				printf("%lld",n);
				return 0;
			}
		}
	}
	printf("%lld",n);
	return 0;
}