#include<algorithm>
#include<fstream>
using namespace std;
ifstream f("next.in");
ofstream g("next.out");
int n,i,m,y,j,a[1000000],a1[1000000],b[100];
long long d,t;
char c;
int main()
{f.get(c);
n=0;
while(c!='\n')
{a[++n]=c-48;
a1[n]=a[n];
f.get(c);
}
for(i=1;i<=n/2;++i)
	swap(a[i],a[n-1+1]),swap(a1[i],a1[n-1+1]);
f>>d;
j=n;
while(j)
{t=t*10+a[j];
a[j]=t/d;
t=t%d;
--j;
}
t=d-t;
m=0;
while(t)
{++m;
b[m]=t%10;
t/=10;
}
t=0;

for(i=1;i<=max(n,m);++i)
{y=t+a1[i]+b[i];
a1[i]=y%10;
t=y/10;
}
n=max(n,m);
while(t)
{++n;
a1[n]=t%10;
t/=10;
}
for(i=n;i;--i)
	g<<a1[i];
g<<'\n';
return 0;
}