#include <iostream.h>
#include <stdio.h>
#include <fstream.h>
#define LG_MAX 200000+1
typedef int BigNumber[LG_MAX];
BigNumber N,r;    //M este rezultatul; M=N+( (D-R) %D ) %10
long long D,i,R,p;
char s[LG_MAX],temp,sir[LG_MAX];

int mod (BigNumber a, int b)  //functie calculare rest
{
      int i,t=0;
      for (i=a[0];i>0;i--)
              t=(t*10+a[i])%b;
      return t;
}

void add (BigNumber a, BigNumber b)
{
      int i,t=0;
      for (i=1;i<=a[0] || i<=b[0] || t; i++,t/=10)
              a[i]=(t+=a[i]+b[i])%10;
      a[0]=i-1;
}

int main()
{
    ifstream f("next.in");
    ofstream g("next.out");
    i=0;
    while (!f.eof() )
          {
          f.get(temp);  //citesc din fisier caracter cu caracter
          if ( (temp=='\r') || (temp=='\n') || (!isdigit(temp)) ) break;
          s[i]=temp;
          i++;
          }
    s[i]='\0';  //inchei sirul cu NULL
    f>>D;
   f.close();
    N[0]=strlen(s); //calculez lungimea sirului
    for (i=N[0]-1;i>=0;i--)
        N[N[0]-i]=s[i]-'0';
    for (i=N[0]+1;i<LG_MAX;i++)
        N[i]=0;
    R=mod(N,D);
    p=D-R;
    p=p%D;
    //p=( (D-R) %D) %10
    i=0;
    while (p)
          {
          sir[i]=p%10 + '0';
          p/=10;
          i++;
          }
    r[0]=strlen(sir);
    for (i=r[0]-1;i>=0;i--)
        r[r[0]-i]=sir[i]-'0';
    for (i=r[0]+1;i<LG_MAX;i++)
        r[i]=0;
    add (N,r);
   for (int i=N[0];i>=1;i--)
         g<<N[i];
    g.close();
    return 0;
}