#include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << ", " << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define M 1000000007
typedef pair<int, int> ii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ii> vii;

int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    srand(chrono::high_resolution_clock::now().time_since_epoch().count());

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

    while (t--)
    {
        ll n, k;
        cin >> n >> k;
        while (k--)
        {
            if (n % 200 == 0)
            {
                n /= 200;
            }
            else
            {
                n *= 1000;
                n += 200;
            }
        }
        cout << n;
    }

    return 0;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
	ll N, K;
	cin >> N >> K;
	for (; K; K--) {
		if (N % 200 == 0) {
			N /= 200;
		}
		else {
			N = N * 1000 + 200;
		}
	}
	cout << N << endl;
}