#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>

#define AS(a) (sizeof(a)/sizeof(a[0]))
using namespace std;
long long int MOD = 1000000007;
long long int INF = 1000000007;


int main() {
  int out[20];
  int t;
  char v[6];
  for(int i = 0; i < 20; i++) {
    out[i] = 0;
  }
  cin >> v >> t;
  for(int i = 2; i < 6; i++) {
    out[i + 14] = (int)(v[i] - '0');
  }
  int next[20];
  for(int i = 0; i < 20; i++) {
    next[i] = 0;
  }
  for(int i = 19; i >= 0; i--) {
    int tt = out[i] * t;
    string k = to_string(tt);
    for(int j = (int)k.length()-1; j >= 0; j--) {
      int id = (int)k.length() - 1 - j;
      next[i - id] += (int)(k[j] - '0');
      if(next[i - id] >= 10) {
        next[i - id - 1] += next[i - id] / 10;
        next[i - id] %= 10;
      }
    }
  }
  string k = "";
  bool al = false;
  for(int i = 0; i < 16; i++) {
    if(!al && next[i] == 0) continue;
    al = true;
    k += to_string(next[i]);
  }
  if(k.length() == 0) k = "0";
  cout << k << endl;




}