from math import ceil n,k=map(int,input().split()) m=max(ceil(n/k),ceil(n**(0.5))) print(m) grid = [[0]*m for i in range(m)] y=[0]*m x=[0]*m count=0 for i in range(m): for j in range(m): if y[i]