#include <iostream>
#include <stdio.h>
#include <cstdio>
#include <stack>
#include<algorithm>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;

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

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define F first
#define S second
#define YES(n)cout << ((n) ? "YES" : "NO"  ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No"  ) << endl
int main(){
    int n,m;
    cin>>n>>m;
    set<int> a;
    set<int> b;
    int maxint=0;
    rep(i,n){
        int aa;
        cin>>aa;
        maxint=max(maxint,aa);
        a.insert(aa);
    }
    rep(i,m){
        int bb;
        cin>>bb;
        maxint=max(maxint,bb);
        b.insert(bb);
    }
    for(int i=1;i<=maxint;i++){
        if(a.count(i)^b.count(i))cout<<i<<" ";
    }
    cout<<endl;
    return 0;
}