#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("next.in");
ofstream g("next.out");
typedef int Huge[1000010];
Huge a;
long long d,r;
int i;
char c=0;
long long Mod(Huge A, long long X)
{ int i;
  long long R=0;
  for (i=A[0];i;i--)
    R=(10*R+A[i])%X;
  return R;
}

int main()
{   f.get(c);
    while(c!='\n')
    {   a[++a[0]]=c-'0';
        f.get(c);
    }
    reverse(a+1,a+a[0]+1);
    f>>d;
    r=Mod(a,d);
    if(r)
    {   int i;
        long long T=d-r;
        for (i=1;i<=a[0];i++)
        {   long long k=T%10;
            a[i]+=k;
            T+=a[i]/10;
            a[i]%=10;
        }
        while(T) {a[++a[0]]=T%10;T/=10;}
    }
    for(int i=a[0];i>=1;i--) g<<a[i];
    return 0;
}