#include <stdio.h>
#include <string.h>
long long n[2000000],rest[10000];
char m[2000000];
int mod(long long A[], long long B)
{
      long long i, t = 0;
      for (i = A[0]; i > 0; i--)
              t = (t * 10 + A[i]) % B;
      return t;
}
void add(long long A[], long long B[])
{
      long long 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(){
	long long i,d,r;
	freopen("next.in","r",stdin);
	freopen("next.out","w",stdout);
	scanf("%s\n",m);
	scanf("%lld",&d);
	n[0]=strlen(m);
	for(i=1;i<=n[0];i++)
		n[i]=m[n[0]-i]-'0';
	r=mod(n,d);
	r=(d-r)%d;
	rest[0]=0;
	while(r){
		rest[++rest[0]]=r%10;
		r/=10;
	}
	add(n,rest);
	for(i=n[0];i>=1;i--)
		printf("%lld",n[i]);
	return 0;
}