#include <bits/stdc++.h>
//#define DEBUG
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;
const int M = 2e5 + 100;
using namespace std;
inline ll read() {
    ll x = 0, f = 1; char ch = getchar();	while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); }
    return x * f;
}
void solve() {
    ll n,k;
    cin >> n >> k;
    for (int i = 0; i < k; i++) {
        if (n % 200)n = n * 1000 + 200;
        else n /= 200;
    }
    cout << n << endl;
    return;
}
int main() {
    IO;
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
    //	freopen("output.txt", "w", stdout);
#endif
    int test;
    solve();
    return 0;
}
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int n, m; cin >> n >> m;
	int c0 = 0, c1 = 0;
	for (int i = 0; i < n; i++) {
		string s; cin >> s;
		int c = 0;
		for (int j = 0; j < m; j++)
			if (s[j] == '1')
				c++;
		if (c & 1) c1++;
		else c0++;
	}
	cout << 1LL * c0 * c1 << '\n';
	return 0;
}
