#include <bits/stdc++.h>

using namespace std;

ifstream f("next.in");
ofstream g("next.out");

short N[1000010], Di[1000010], one[1000010] = {0, 1};
long long D;
char str[1000010];
long long divide(short a[], long long nr)
{
    long long rest = 0;
    for (int i = a[0]; i >= 1; i--) {
        rest = 10 * rest + a[i];
        a[i] = rest / nr;
        rest %= nr;
    }
    while (a[0] > 0 && !a[a[0]]) a[0]--;
    return rest;
}
void add(short a[], short b[])
{
    int transport = 0, i = 1;
    for (i = 1; i <= a[0] || b[0]; i++) {
        transport += a[i] + b[i];
        a[i] = transport % 10;
        transport /= 10;
    }
    a[0] = i - 1;
}

void multiply(short a[], long long b)
{
    int transport = 0, i = 1;
    for (i = 1; i <= a[0] || transport > 0; i++) {
        transport += a[i] * b;
        a[i] = transport % 10;
        transport /= 10;
    }
    a[0] = i - 1;
}
int main()
{
    f >> str >> D;
    N[0] = strlen(str);
    for(int i = 1; i <= N[0]; i++)
        N[i] = str[N[0] - i] - '0';
    int rest = divide(N, D);
    if(rest) add(N, one);
    multiply(N, D);
    for(int i = N[0]; i >= 1; i--)
        g << N[i];
    g << "\n";
    return 0;
}