#include <stdio.h>
#include <string.h>
#define M 999999 
char S[M];
int N[M],K[50],H[50];
void sub(int A[], int B[])
{
      int i, t = 0;
      for (i = 1; i <= A[0]; i++)
              A[i] += (t = (A[i] -= B[i] + t) < 0) * 10;
      for (; A[0] > 1 && !A[A[0]]; A[0]--);
}
void add(int A[], int B[])
{
    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;
}
int mod(int A[], long long B)
{
    int i, t = 0;
    for (i = A[0]; i > 0; i--)
        t = (t * 10 + A[i]) % B;
    return t;
}

int main()
{
	long long  D,R;
    long long c,l,i;
	freopen("next.in", "r",stdin);
	freopen("next.out", "w",stdout);
	scanf("%s", &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);
	i=1;
	while(R>0)
	{
		K[0]=i;
		c=R%10;
		R/=10;
		K[i]=c;
		++i;
	}	
	sub(N,K);
	i=1;
	while(D>0)
	{
		H[0]=i;
		c=D%10;
		D/=10;
		H[i]=c;
		++i;
	}	
	if(K[0]>0)
		add(N,H);
	for(i=N[0];i>=1;--i)
		printf("%d", N[i]);
	return 0;
}