




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				int:
						while a != 0:
												_UpperCAmelCase    ,					_UpperCAmelCase      =			b % a, a
						return b




def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				int:
						if gcd(snake_case			,     snake_case       ) != 1:
												_UpperCAmelCase      =			f"mod inverse of {a!r} and {m!r} does not exist"
												raise ValueError(snake_case       )
						_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase      =			1, 0, a
						_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase      =			0, 1, m
						while va != 0:
												_UpperCAmelCase      =			ua // va
												_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase    ,					_UpperCAmelCase      =			(ua - q * va), (ua - q * va), (ua - q * va), va, va, va
						return ua % m





def        _SCREAMING_SNAKE_CASE      (		snake_case			,     snake_case       )						->				bool:
						_UpperCAmelCase      =			len(snake_case       ) + 1
						_UpperCAmelCase      =			len(snake_case       ) + 1

						# dp is a 2d matrix where dp[i][j] denotes whether prefix string of
						# length i of input_string matches with prefix string of length j of
						# given pattern.
						# "dp" stands for dynamic programming.
						_UpperCAmelCase      =			[[0 for i in range(snake_case       )] for j in range(snake_case       )]

						# since string of zero length match pattern of zero length
						_UpperCAmelCase      =			1

						# since pattern of zero length will never match with string of non-zero length
						for i in range(1			,     snake_case       ):
												_UpperCAmelCase      =			0

						# since string of zero length will match with pattern where there
						# is at least one * alternatively
						for j in range(1			,     snake_case       ):
												_UpperCAmelCase      =			dp[0][j - 2] if pattern[j - 1] == """*""" else 0

						# now using bottom-up approach to find for all remaining lengths
						for i in range(1			,     snake_case       ):
												for j in range(1			,     snake_case       ):
																		if input_string[i - 1] == pattern[j - 1] or pattern[j - 1] == ".":
																								_UpperCAmelCase      =			dp[i - 1][j - 1]

																		elif pattern[j - 1] == "*":
																								if dp[i][j - 2] == 1:
																														_UpperCAmelCase      =			1
																								elif pattern[j - 2] in (input_string[i - 1], "."):
																														_UpperCAmelCase      =			dp[i - 1][j]
																								else:
																														_UpperCAmelCase      =			0
																		else:
																								_UpperCAmelCase      =			0

						return bool(dp[-1][-1]       )


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				# inputing the strings
				# input_string = input("input a string :")
				# pattern = input("input a pattern :")

				a													=			"aab"
				a													=			"c*a*b"

				# using function to check whether given string matches the given pattern
				if match_pattern(input_string, pattern):
								print(F'{input_string} matches the given pattern {pattern}')
				else:
								print(F'{input_string} does not match with the given pattern {pattern}')