#include <stdio.h>
#include <string.h>
#define M 1000002 
#define m 40
char S[M];
int N[M],H[m],K[m];
long long  D,R;
/*void sub(int A[M], int H[m])
{
    int i, t = 0;
    for (i = 1; i <= A[0]; i++)
        A[i] += (t = (A[i] -= H[i] + t) < 0) * 10;
    for (; A[0] > 1 && !A[A[0]]; A[0]--);
}
void add(int A[M], int B[m])
{
    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;
}*/
long long mod(int A[], long long D)
{
    int i, t = 0;
    for (i = A[0]; i > 0; i--)
        t = (t * 10 + A[i]) % D;
    return t;
}
/*void transform(int H[m], long long x)
{
	H[0]=0;
	do{
		H[++H[0]]=x%10;
		x/=10;
	}while(x);
}*/
void adun(int A[],long long B){
	int i,t=0;
	long long b=B;
	for(i=1;i<=A[0] || b || t;i++,t/=10,b/=10)
		A[i]= (t+= A[i]+b%10)%10;
	A[0]=i-1;
}
int main()
{
	int i,l;
	freopen("next.in", "r", stdin);
	freopen("next.out", "w", stdout);
	scanf("%s\n", S);
	scanf("%lld", &D);
	l=strlen(S);
	N[0]=l;
	for(i=1;i<=l;++i)
		N[i]=(S[l-i]-'0');
	R=mod(N,D);
	if(R>0)
	{
		R=D-R;
		adun(N,R);
	}
	for(i=N[0];i>=1;--i)
		printf("%d", N[i]);
	return 0;
}