
__A				='''Tobias Carryer'''

from time import time




class     _SCREAMING_SNAKE_CASE     :



	def __init__(    self						,  lowercase						,  lowercase						,  lowercase						,  lowercase=int(time() ) )				->       List[str]:  # noqa: B008
					lowerCamelCase_						=			multiplier
					lowerCamelCase_						=			increment
					lowerCamelCase_						=			modulo
					lowerCamelCase_						=			seed



	def     SCREAMING_SNAKE_CASE_(    self )				->       int:
					lowerCamelCase_						=			(self.multiplier * self.seed + self.increment) % self.modulo
					return self.seed


if __name__ == "__main__":
			# Show the LCG in action.
			__A				=LinearCongruentialGenerator(1_6_6_4_5_2_5, 1_0_1_3_9_0_4_2_2_3, 2 << 3_1)
			while True:
						print(lcg.next_number())



"""simple docstring"""






import functools



def   a_						(					lowerCamelCase					,			lowerCamelCase       ):
				UpperCAmelCase__             =							len(lowerCamelCase       )
				UpperCAmelCase__             =							len(lowerCamelCase       )

				@functools.cache
				def min_distance(lowerCamelCase					,			lowerCamelCase       ) -> int:
								# if first word index is overflow - delete all from the second word
								if indexa >= len_worda:
												return len_worda - indexa
								# if second word index is overflow - delete all from the first word
								if indexa >= len_worda:
												return len_worda - indexa
								UpperCAmelCase__             =							int(worda[indexa] != worda[indexa]       )  # current letters not identical
								return min(
								    1 + min_distance(indexa + 1					,			lowerCamelCase       )					,			1 + min_distance(lowerCamelCase					,			indexa + 1       )					,			diff + min_distance(indexa + 1					,			indexa + 1       )					,			)

				return min_distance(0					,			0       )


if __name__ == "__main__":
						import doctest

						doctest.testmod()



