#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int NMAX=1000005;

long long rest_hn_int(int a[],long long k)
{
	int i;
	long long r;
	r=0;
	for(i=a[0];i>=1;i--)
	{
		r=r*10+a[i];
		r=r%k;
	}
	return r;
}

void h_adun(int a[],long long k)
{
    int i,tr;
    long long aux;
    for(i=1;i<=a[0];i++)
    {
        aux=a[i]+k;
        a[i]=aux%10;
        k=aux/10;
    }
}
void print(int a[])
{
    int i;
    for(i=a[0];i>=1;i--)
        printf("%d",a[i]);
    printf("\n");
}
int a[NMAX];
int main()
{
    freopen("next.in","r",stdin);
    freopen("next.out","w",stdout);
    char ch;
    int n,i,cnt=0;
    long long k,ck;
    while(scanf("%c",&ch)&&ch!='\n')
    {
        if(ch>='0'&&ch<='9')
            a[++a[0]]=ch-'0';
    }
    reverse(a+1,a+a[0]+1);
    scanf("%lld",&k);
    ck=rest_hn_int(a,k);
    if(ck!=0)
        ck=k-ck;
    h_adun(a,ck);
    print(a);
    return 0;
}