#include <stdio.h>
#include <string.h>

#define maxn 1000
#define maxd 20
int n[maxn];
int d[maxd];
int r[maxd];

int mod(int A[], int B)   
{   
      int i, t = 0;   
      for (i = A[0]; i > 0; i--)   
              t = (t * 10 + A[i]) % B;   
      return t;   
}   
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;   
}   
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 init()
{
	memset(n,0,sizeof(n));
	memset(d,0,sizeof(d));
	memset(r,0,sizeof(r));
}
int main()
{
	init();
	freopen("next.in","r",stdin);
	freopen("next.out","w",stdout);
	int _n,_d;
	scanf("%d\n%d",&_n,&_d);
	printf("%d",(_d-(_n%_d))%_d+_n);
	return 546;
}