#include <fstream>
#include <string.h>
#include <algorithm>

using namespace std;

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

long long m,add,i,nr,r,rr,nrr,s[1000001];
char c;

int main()
{

   while (f>>noskipws>>c && c!='\n')
    s[++nrr]=c-48;

    f>>m;

    for (i=1;i<=nrr;i++)
      add=(add*10+s[i])%m;

   for (i=1;i<=nrr/2;i++)
    swap(s[i],s[nrr-i+1]);

    add=(m-add)%m;

   nr=1;

    while (r || add)
     {
         rr=(s[nr]+add%10+r)/10;

         s[nr]=(s[nr]+add%10+r)%10;
         r=rr;
         nr++;
         add/=10;

     }

     if (nr-1>nrr)
      nrr=nr-1;

    for (i=nrr;i>=1;i--)
     g<<s[i];


   f.close();
   g.close();
}