#include <algorithm>
#include <cstring>
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;

int pot10[ 10 ];

int n, najm;

int main( ){
  pot10[0] = 1;
  for( int i = 1; i <= 10; ++i )
    pot10[i] = pot10[i-1] * 10;
  scanf( "%d%d", &n, &najm );
  int ret = 0;
  for( int i = 9; i >= najm; --i ){
    ret += (n / pot10[i]) * pot10[i];
    n %= pot10[i];  
  } 
  if( abs( pot10[najm] - n ) > n )
    cout << ret << endl;
  else
    cout << ret + pot10[najm] << endl;
  //system( "pause" );
  return 0;    
}