#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;

ifstream fin ("next.in");
ofstream fout("next.out");
#define baza 10
#define MAX 1000010
long long int i,s,m,a1,t,j,l,d,k,ci,kl;
char n[MAX];

long long int a[MAX];


void inm(unsigned int* al, unsigned int* bl, unsigned int* ml)
{

    ml[0]=al[0]+bl[0]-1;
    for(i=1;i<=al[0];i++)
    {
        for(j=1;j<=bl[0];j++)
        {
            ml[i-1+j]+=al[i]*bl[j];

        }
    }

    for(i=1;i<=ml[0];i++)
    {

        if(ml[i]>9)
        {
            ml[i+1]+=ml[i]/10;
            ml[i]%=10;
        }
    }
    if(ml[i])
        ml[0]++;




}

void transforma(long long int sos, unsigned int* al)
{
    long long int k=0;

    while(sos)
    {
        al[++k]=sos%baza;
        sos/=baza;
    }


    al[0]=k;

}

void fshow(long long  int *al)
{
    for(i=al[0];i>=1;i--)
    {
        fout<<al[i];
    }
}

void show(unsigned int *al)
{
    for(i=al[0];i>=1;i--)
    {
        cout<<al[i];
    }
}

long long int mod(long long int* al,long long int d)
{
    long long int p=0;
    for(i=al[0];i>=1;i--)
    {


        long long int xi=al[i]+p;
        p=xi%d;
p*=baza;
    }
    p/=baza;
    return p;
}

long long modulo( unsigned int* A,long long int B)
{
    long long i, T = 0;

    for ( i = A[0]; i; --i )
            T = ( T * baza + A[i] ) % B;

    return T;
}


void add(long long int* cl, long long int d)
{

    a[1]+=d;
    for(kl=1;kl<=cl[0];kl++)
    {
        cl[kl+1]+=(cl[kl]/baza);

        cl[kl]%=baza;

    }

    if(cl[cl[0]+1])
        cl[0]++;


}

int main()
{

    fin>>n;
    a[0]=strlen(n);
    for(i=1;i<=a[0];i++)
    {
        a[i]=n[a[0]-i]-'0';
    }
    fin>>d;

    long long int p=mod(a,d);
    if(p)
    {
        add(a,d-p);
    }
        fshow(a);
    return 0;
}