human
Smallest number required to be added to M to make it divisible by N | Function to find the smallest number greater than or equal to N , that is divisible by k.
Function to find the smallest number required to be added to to M to make it divisible by N.
Stores the smallest multiple of N , greater than or equal to M.
Return the result.
Driver Code.
Given Input.
Function Call"
Solution in Python:

Write me a code to smallest number required to be added to M to make it divisible by N and the other steps required?
assistant
#Here is code to smallest number required to be added to M to make it divisible by N and the other steps required.
 def findNum ( N , K ) :
	rem = ( N + K ) % K
	if ( rem == 0 ) :
		return N
	else :
		return N + K - rem
def findSmallest ( M , N ) :
	x = findNum ( M , N )
	return x - M
if __name__ == ' _ _ main _ _ ' :
	M = 100
	N = 28
	print ( findSmallest ( M , N ) )