#include<stdio.h>
#include<algorithm>
using namespace std;
long long d;int a[1000005],b[1000];
char sir[1000005];
long long rest()
{
    int i;long long t=(long long)0;
    for(i=a[0];i;i--)
        t=(t*10+(long long)a[i])%d;
    return t;
}
void aduna()
{
    int i,t=0;
    for(i=1;i<=a[0] || i<=b[0] || t;t/=10,i++)
        a[i]=(t=a[i]+b[i])%10;
    a[0]=i-1;
}
int main()
{
    int i,j;long long r;
    freopen("next.in","r",stdin);
    freopen("next.out","w",stdout);
    gets(sir);scanf("%lld",&d);
    for(i=0;sir[i];i++) a[++a[0]]=sir[i]-'0';
    j=a[0];i=1;
    while(i<j){
        swap(a[i],a[j]);
        i++;j--;
    }
    r=rest();
    r=(d-r)%d;
    aduna();
    for(i=1;i<=a[0];i++) printf("%d",a[i]);
    fclose(stdin);fclose(stdout);
    return 0;
}