#include <iostream>

using namespace std;

int main()
{


    long long n, k;

    cin >> n >> k;

    for(int i=1; i<=k; ++i)
    {
        if(n%200 == 0)
            n/=200;
        
        else
        {
            n *= 1000;
            n += 200;
        }
    }

    cout << n << endl;

    return 0;
}
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define pii pair<int,int>
#define vpii vector<pii >
#define all(a) a.begin(),a.end()
using namespace std;
const int INF=1<<30;
//const ll INF=1ll<<60;
const ll MOD=1e9+7;
inline void read(int &x){
//	short neg=1;
	x=0;
	char c=getchar();
	/*while(c<'0'||c>'9'){
		if(c=='-')neg=-1;
		c=getchar();
	}*/
	while(c>='0'&&c<='9'){
		x=(x<<3)+(x<<1)+(c^48),c=getchar();
	}
//	x*=neg;
}
ll quick_mod(ll A,ll B){//A^B
    ll ret=1;
    A%=MOD;
    while(B)
    {
        if(B&1)ret=ret*A%MOD;
        B>>=1;
        A=A*A%MOD;
    }
    return ret;
}
ll N;
int k;
int main(void){
	cin>>N;
	cin>>k;
	while(k--){
		if(N%200==0){
			N/=200;
		}
		else{
			N=N*1000+200;
		}
	}
	cout<<N;
	return 0;
}

